/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:31:20,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:31:20,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:31:20,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:31:20,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:31:20,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:31:20,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:31:20,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:31:20,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:31:20,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:31:20,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:31:20,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:31:20,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:31:20,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:31:20,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:31:20,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:31:20,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:31:20,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:31:20,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:31:20,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:31:20,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:31:20,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:31:20,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:31:20,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:31:20,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:31:20,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:31:20,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:31:20,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:31:20,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:31:20,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:31:20,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:31:20,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:31:20,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:31:20,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:31:20,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:31:20,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:31:20,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:31:20,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:31:20,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:31:20,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:31:20,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:31:20,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:31:20,445 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:31:20,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:31:20,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:31:20,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:31:20,448 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:31:20,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:31:20,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:31:20,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:31:20,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:31:20,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:31:20,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:31:20,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:31:20,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:31:20,450 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:31:20,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:31:20,450 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:31:20,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:31:20,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:31:20,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:31:20,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:31:20,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:31:20,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:31:20,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:31:20,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:31:20,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:31:20,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:31:20,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:31:20,452 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:31:20,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:31:20,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:31:20,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:31:20,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:31:20,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:31:20,808 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:31:20,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-12-13 00:31:21,860 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:31:22,169 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:31:22,170 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-12-13 00:31:22,187 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62bfb1bb5/dd33e1a1b6294e51a423ff17baa072a4/FLAG1d91753b9 [2022-12-13 00:31:22,206 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62bfb1bb5/dd33e1a1b6294e51a423ff17baa072a4 [2022-12-13 00:31:22,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:31:22,210 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:31:22,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:31:22,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:31:22,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:31:22,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2942508f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22, skipping insertion in model container [2022-12-13 00:31:22,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:31:22,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:31:22,632 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-12-13 00:31:22,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:31:22,667 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:31:22,722 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-12-13 00:31:22,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:31:22,789 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:31:22,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22 WrapperNode [2022-12-13 00:31:22,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:31:22,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:31:22,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:31:22,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:31:22,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,861 INFO L138 Inliner]: procedures = 277, calls = 43, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 152 [2022-12-13 00:31:22,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:31:22,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:31:22,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:31:22,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:31:22,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,902 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:31:22,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:31:22,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:31:22,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:31:22,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (1/1) ... [2022-12-13 00:31:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:31:22,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:22,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:31:22,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:31:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 00:31:22,971 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 00:31:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 00:31:22,971 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 00:31:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:31:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:31:22,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:31:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:31:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 00:31:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:31:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:31:22,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:31:22,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:31:22,973 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:31:23,134 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:31:23,136 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:31:23,419 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:31:23,426 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:31:23,426 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 00:31:23,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:31:23 BoogieIcfgContainer [2022-12-13 00:31:23,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:31:23,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:31:23,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:31:23,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:31:23,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:31:22" (1/3) ... [2022-12-13 00:31:23,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1955c6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:31:23, skipping insertion in model container [2022-12-13 00:31:23,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:22" (2/3) ... [2022-12-13 00:31:23,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1955c6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:31:23, skipping insertion in model container [2022-12-13 00:31:23,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:31:23" (3/3) ... [2022-12-13 00:31:23,442 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-12-13 00:31:23,458 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:31:23,458 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:31:23,459 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:31:23,568 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 00:31:23,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 154 transitions, 324 flow [2022-12-13 00:31:23,692 INFO L130 PetriNetUnfolder]: 10/152 cut-off events. [2022-12-13 00:31:23,692 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:31:23,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 10/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-13 00:31:23,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 154 transitions, 324 flow [2022-12-13 00:31:23,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 143 transitions, 295 flow [2022-12-13 00:31:23,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:23,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 143 transitions, 295 flow [2022-12-13 00:31:23,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 143 transitions, 295 flow [2022-12-13 00:31:23,805 INFO L130 PetriNetUnfolder]: 10/143 cut-off events. [2022-12-13 00:31:23,806 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:31:23,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 143 events. 10/143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 310 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-13 00:31:23,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 143 transitions, 295 flow [2022-12-13 00:31:23,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-13 00:31:29,542 INFO L241 LiptonReduction]: Total number of compositions: 120 [2022-12-13 00:31:29,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:31:29,562 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e14caac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:31:29,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:31:29,571 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-12-13 00:31:29,571 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:31:29,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:29,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 00:31:29,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:29,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2126127621, now seen corresponding path program 1 times [2022-12-13 00:31:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:29,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977008589] [2022-12-13 00:31:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:29,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:29,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977008589] [2022-12-13 00:31:29,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977008589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:29,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:29,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827670318] [2022-12-13 00:31:29,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:29,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:31:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:29,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:31:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:31:29,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 110 [2022-12-13 00:31:29,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:29,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:29,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 110 [2022-12-13 00:31:29,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:31,465 INFO L130 PetriNetUnfolder]: 12154/20272 cut-off events. [2022-12-13 00:31:31,465 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-12-13 00:31:31,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40006 conditions, 20272 events. 12154/20272 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 148337 event pairs, 5818 based on Foata normal form. 0/6575 useless extension candidates. Maximal degree in co-relation 39439. Up to 12881 conditions per place. [2022-12-13 00:31:31,539 INFO L137 encePairwiseOnDemand]: 89/110 looper letters, 148 selfloop transitions, 9 changer transitions 2/170 dead transitions. [2022-12-13 00:31:31,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 170 transitions, 673 flow [2022-12-13 00:31:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:31:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:31:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-12-13 00:31:31,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2022-12-13 00:31:31,553 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 229 flow. Second operand 3 states and 208 transitions. [2022-12-13 00:31:31,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 170 transitions, 673 flow [2022-12-13 00:31:31,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 170 transitions, 665 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:31:31,564 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 280 flow [2022-12-13 00:31:31,566 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2022-12-13 00:31:31,569 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2022-12-13 00:31:31,570 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:31,570 INFO L89 Accepts]: Start accepts. Operand has 108 places, 108 transitions, 280 flow [2022-12-13 00:31:31,573 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:31,573 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:31,573 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 108 transitions, 280 flow [2022-12-13 00:31:31,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 108 transitions, 280 flow [2022-12-13 00:31:31,614 INFO L130 PetriNetUnfolder]: 96/616 cut-off events. [2022-12-13 00:31:31,615 INFO L131 PetriNetUnfolder]: For 14/34 co-relation queries the response was YES. [2022-12-13 00:31:31,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 616 events. 96/616 cut-off events. For 14/34 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4842 event pairs, 10 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 820. Up to 126 conditions per place. [2022-12-13 00:31:31,625 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 108 transitions, 280 flow [2022-12-13 00:31:31,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 5426 [2022-12-13 00:31:31,702 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:31:31,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 00:31:31,704 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 108 transitions, 280 flow [2022-12-13 00:31:31,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:31,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:31,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:31,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:31:31,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1823508073, now seen corresponding path program 1 times [2022-12-13 00:31:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:31,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950841491] [2022-12-13 00:31:31,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:31,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:31,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950841491] [2022-12-13 00:31:31,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950841491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:31,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:31,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330143464] [2022-12-13 00:31:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:31,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:31:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:31,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:31:31,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:31:31,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 104 [2022-12-13 00:31:31,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 108 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:31,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:31,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 104 [2022-12-13 00:31:31,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:33,998 INFO L130 PetriNetUnfolder]: 18904/31402 cut-off events. [2022-12-13 00:31:33,999 INFO L131 PetriNetUnfolder]: For 1123/1123 co-relation queries the response was YES. [2022-12-13 00:31:34,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65686 conditions, 31402 events. 18904/31402 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 1519. Compared 247348 event pairs, 12450 based on Foata normal form. 0/10682 useless extension candidates. Maximal degree in co-relation 63300. Up to 20000 conditions per place. [2022-12-13 00:31:34,127 INFO L137 encePairwiseOnDemand]: 91/104 looper letters, 160 selfloop transitions, 11 changer transitions 0/185 dead transitions. [2022-12-13 00:31:34,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 185 transitions, 817 flow [2022-12-13 00:31:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:31:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:31:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2022-12-13 00:31:34,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6698717948717948 [2022-12-13 00:31:34,134 INFO L175 Difference]: Start difference. First operand has 106 places, 108 transitions, 280 flow. Second operand 3 states and 209 transitions. [2022-12-13 00:31:34,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 185 transitions, 817 flow [2022-12-13 00:31:34,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 185 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:31:34,248 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 343 flow [2022-12-13 00:31:34,248 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2022-12-13 00:31:34,249 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2022-12-13 00:31:34,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:34,249 INFO L89 Accepts]: Start accepts. Operand has 107 places, 117 transitions, 343 flow [2022-12-13 00:31:34,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:34,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:34,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 117 transitions, 343 flow [2022-12-13 00:31:34,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 117 transitions, 343 flow [2022-12-13 00:31:34,318 INFO L130 PetriNetUnfolder]: 151/831 cut-off events. [2022-12-13 00:31:34,319 INFO L131 PetriNetUnfolder]: For 66/111 co-relation queries the response was YES. [2022-12-13 00:31:34,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 831 events. 151/831 cut-off events. For 66/111 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6749 event pairs, 15 based on Foata normal form. 5/214 useless extension candidates. Maximal degree in co-relation 1215. Up to 163 conditions per place. [2022-12-13 00:31:34,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 117 transitions, 343 flow [2022-12-13 00:31:34,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 6332 [2022-12-13 00:31:34,406 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:31:34,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 00:31:34,408 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 343 flow [2022-12-13 00:31:34,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:34,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:34,408 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:34,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:31:34,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1384250486, now seen corresponding path program 1 times [2022-12-13 00:31:34,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:34,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251079258] [2022-12-13 00:31:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:34,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:34,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251079258] [2022-12-13 00:31:34,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251079258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:31:34,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844126932] [2022-12-13 00:31:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:34,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:34,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:34,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:31:34,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 00:31:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:34,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 00:31:34,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:31:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:34,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:31:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:34,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844126932] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:31:34,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:31:34,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 00:31:34,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624817388] [2022-12-13 00:31:34,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:31:34,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 00:31:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:34,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 00:31:34,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 00:31:34,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 104 [2022-12-13 00:31:34,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 343 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:34,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:34,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 104 [2022-12-13 00:31:34,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:38,793 INFO L130 PetriNetUnfolder]: 36441/59371 cut-off events. [2022-12-13 00:31:38,794 INFO L131 PetriNetUnfolder]: For 4740/4740 co-relation queries the response was YES. [2022-12-13 00:31:38,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132552 conditions, 59371 events. 36441/59371 cut-off events. For 4740/4740 co-relation queries the response was YES. Maximal size of possible extension queue 2188. Compared 482582 event pairs, 7995 based on Foata normal form. 205/21411 useless extension candidates. Maximal degree in co-relation 128239. Up to 21338 conditions per place. [2022-12-13 00:31:38,985 INFO L137 encePairwiseOnDemand]: 88/104 looper letters, 499 selfloop transitions, 73 changer transitions 181/764 dead transitions. [2022-12-13 00:31:38,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 764 transitions, 3535 flow [2022-12-13 00:31:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 00:31:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 00:31:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 947 transitions. [2022-12-13 00:31:38,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.479251012145749 [2022-12-13 00:31:38,989 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 343 flow. Second operand 19 states and 947 transitions. [2022-12-13 00:31:38,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 764 transitions, 3535 flow [2022-12-13 00:31:39,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 764 transitions, 3492 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:31:39,008 INFO L231 Difference]: Finished difference. Result has 126 places, 187 transitions, 802 flow [2022-12-13 00:31:39,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=802, PETRI_PLACES=126, PETRI_TRANSITIONS=187} [2022-12-13 00:31:39,010 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 15 predicate places. [2022-12-13 00:31:39,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:39,010 INFO L89 Accepts]: Start accepts. Operand has 126 places, 187 transitions, 802 flow [2022-12-13 00:31:39,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:39,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:39,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 187 transitions, 802 flow [2022-12-13 00:31:39,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 187 transitions, 802 flow [2022-12-13 00:31:39,149 INFO L130 PetriNetUnfolder]: 415/2331 cut-off events. [2022-12-13 00:31:39,149 INFO L131 PetriNetUnfolder]: For 387/570 co-relation queries the response was YES. [2022-12-13 00:31:39,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 2331 events. 415/2331 cut-off events. For 387/570 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24191 event pairs, 35 based on Foata normal form. 15/726 useless extension candidates. Maximal degree in co-relation 3826. Up to 448 conditions per place. [2022-12-13 00:31:39,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 187 transitions, 802 flow [2022-12-13 00:31:39,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 9070 [2022-12-13 00:31:39,216 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [600] L974-->L1011-3: Formula: (and (= (+ 2 |v_t2Thread1of1ForFork1_pop_#res#1_53|) 0) (= |v_t2Thread1of1ForFork1_#t~ret44#1_41| |v_t2Thread1of1ForFork1_pop_#res#1_53|) (= v_~top~0_170 0) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_59| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_67|) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_67| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_59|)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_59|, ~top~0=v_~top~0_170, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_59|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_67|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_59|, t2Thread1of1ForFork1_#t~ret44#1=|v_t2Thread1of1ForFork1_#t~ret44#1_41|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_67|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_31|, ~top~0=v_~top~0_170, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_59|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_53|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_#t~ret44#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#res#1] [2022-12-13 00:31:39,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [549] L974-->pop_returnLabel#1: Formula: (and (= (+ 2 |v_t2Thread1of1ForFork1_pop_#res#1_25|) 0) (= v_~top~0_67 0) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_23| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_35|) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_35| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_23|)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_67, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_23|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_35|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_23|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_35|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_13|, ~top~0=v_~top~0_67, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_23|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#res#1] [2022-12-13 00:31:39,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [503] L950-1-->L948: Formula: (= (+ v_~top~0_28 1) |v_t2Thread1of1ForFork1_dec_top_#t~post32#1_16|) InVars {t2Thread1of1ForFork1_dec_top_#t~post32#1=|v_t2Thread1of1ForFork1_dec_top_#t~post32#1_16|} OutVars{~top~0=v_~top~0_28} AuxVars[] AssignedVars[~top~0, t2Thread1of1ForFork1_dec_top_#t~post32#1] [2022-12-13 00:31:39,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [590] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_112)) InVars {~top~0=v_~top~0_112} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_19|, ~top~0=v_~top~0_112} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1] [2022-12-13 00:31:39,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [512] L974-->L978: Formula: (and (= v_~top~0_37 0) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_21| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_13|) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_13| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_21|)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_13|, ~top~0=v_~top~0_37, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_13|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_21|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_13|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_21|, ~top~0=v_~top~0_37, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_13|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_~stack#1.offset] [2022-12-13 00:31:39,343 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [436] L950-1-->L950-2: Formula: (= |v_t2Thread1of1ForFork1_dec_top_#t~post32#1_5| (+ v_~top~0_12 1)) InVars {t2Thread1of1ForFork1_dec_top_#t~post32#1=|v_t2Thread1of1ForFork1_dec_top_#t~post32#1_5|} OutVars{~top~0=v_~top~0_12, t2Thread1of1ForFork1_dec_top_#t~post32#1=|v_t2Thread1of1ForFork1_dec_top_#t~post32#1_5|} AuxVars[] AssignedVars[~top~0] [2022-12-13 00:31:39,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [548] L974-->L979: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_21| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_33|) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_33| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_21|) (= v_~top~0_65 0)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_21|, ~top~0=v_~top~0_65, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_21|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_33|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_21|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_33|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_11|, ~top~0=v_~top~0_65, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_21|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1] [2022-12-13 00:31:39,393 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [613] L950-1-->L954: Formula: (= (+ v_~top~0_185 1) |v_t2Thread1of1ForFork1_dec_top_#t~post32#1_54|) InVars {t2Thread1of1ForFork1_dec_top_#t~post32#1=|v_t2Thread1of1ForFork1_dec_top_#t~post32#1_54|} OutVars{t2Thread1of1ForFork1_get_top_#res#1=|v_t2Thread1of1ForFork1_get_top_#res#1_39|, ~top~0=v_~top~0_185} AuxVars[] AssignedVars[t2Thread1of1ForFork1_get_top_#res#1, ~top~0, t2Thread1of1ForFork1_dec_top_#t~post32#1] [2022-12-13 00:31:39,501 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:31:39,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 492 [2022-12-13 00:31:39,503 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 185 transitions, 820 flow [2022-12-13 00:31:39,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:39,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:39,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:39,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 00:31:39,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:39,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:39,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash 574105320, now seen corresponding path program 1 times [2022-12-13 00:31:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:39,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436767718] [2022-12-13 00:31:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436767718] [2022-12-13 00:31:39,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436767718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:39,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:39,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:39,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632223634] [2022-12-13 00:31:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:39,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:31:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:39,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:31:39,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:31:39,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 124 [2022-12-13 00:31:39,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 185 transitions, 820 flow. Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:39,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:39,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 124 [2022-12-13 00:31:39,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:43,183 INFO L130 PetriNetUnfolder]: 34292/57183 cut-off events. [2022-12-13 00:31:43,183 INFO L131 PetriNetUnfolder]: For 9188/9344 co-relation queries the response was YES. [2022-12-13 00:31:43,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130616 conditions, 57183 events. 34292/57183 cut-off events. For 9188/9344 co-relation queries the response was YES. Maximal size of possible extension queue 2182. Compared 486129 event pairs, 28305 based on Foata normal form. 6/21803 useless extension candidates. Maximal degree in co-relation 126331. Up to 53769 conditions per place. [2022-12-13 00:31:43,541 INFO L137 encePairwiseOnDemand]: 118/124 looper letters, 155 selfloop transitions, 0 changer transitions 0/179 dead transitions. [2022-12-13 00:31:43,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 179 transitions, 1090 flow [2022-12-13 00:31:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:31:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:31:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-12-13 00:31:43,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2022-12-13 00:31:43,543 INFO L175 Difference]: Start difference. First operand has 123 places, 185 transitions, 820 flow. Second operand 2 states and 138 transitions. [2022-12-13 00:31:43,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 179 transitions, 1090 flow [2022-12-13 00:31:43,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 179 transitions, 1090 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:31:43,588 INFO L231 Difference]: Finished difference. Result has 124 places, 179 transitions, 780 flow [2022-12-13 00:31:43,589 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=780, PETRI_PLACES=124, PETRI_TRANSITIONS=179} [2022-12-13 00:31:43,590 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 13 predicate places. [2022-12-13 00:31:43,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:43,590 INFO L89 Accepts]: Start accepts. Operand has 124 places, 179 transitions, 780 flow [2022-12-13 00:31:43,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:43,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:43,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 179 transitions, 780 flow [2022-12-13 00:31:43,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 179 transitions, 780 flow [2022-12-13 00:31:43,738 INFO L130 PetriNetUnfolder]: 407/2316 cut-off events. [2022-12-13 00:31:43,739 INFO L131 PetriNetUnfolder]: For 443/635 co-relation queries the response was YES. [2022-12-13 00:31:43,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 2316 events. 407/2316 cut-off events. For 443/635 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 24399 event pairs, 35 based on Foata normal form. 15/717 useless extension candidates. Maximal degree in co-relation 3827. Up to 451 conditions per place. [2022-12-13 00:31:43,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 179 transitions, 780 flow [2022-12-13 00:31:43,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 8636 [2022-12-13 00:31:43,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L1008-1-->L974: Formula: (and (= |v_~#arr~0.base_47| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_33|) (< 0 v_~top~0_108) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_33| |v_~#arr~0.offset_47|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_47|, ~top~0=v_~top~0_108, ~#arr~0.base=|v_~#arr~0.base_47|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_47|, t2Thread1of1ForFork1_pop_#t~mem37#1=|v_t2Thread1of1ForFork1_pop_#t~mem37#1_33|, t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_43|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_33|, t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, t2Thread1of1ForFork1_pop_#t~ret36#1=|v_t2Thread1of1ForFork1_pop_#t~ret36#1_37|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_43|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_17|, ~top~0=v_~top~0_108, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_33|, ~#arr~0.base=|v_~#arr~0.base_47|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_37|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_#t~mem37#1, t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_#in~stack#1.offset, t2Thread1of1ForFork1_#t~nondet43#1, t2Thread1of1ForFork1_pop_#t~ret36#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#in~stack#1.base, t2Thread1of1ForFork1_pop_#res#1] and [654] L969-3-->L978: Formula: (and (= v_~top~0_371 0) (= |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_172| v_~top~0_371) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_74| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_118|) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_118| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_74|)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_74|, ~top~0=v_~top~0_371, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_74|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_118|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_192|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_74|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_118|, ~top~0=v_~top~0_371, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_74|, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_172|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t1Thread1of1ForFork0_push_#t~ret34#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-13 00:31:43,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L1008-1-->L974: Formula: (and (= |v_~#arr~0.base_47| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_33|) (< 0 v_~top~0_108) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_33| |v_~#arr~0.offset_47|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_47|, ~top~0=v_~top~0_108, ~#arr~0.base=|v_~#arr~0.base_47|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_47|, t2Thread1of1ForFork1_pop_#t~mem37#1=|v_t2Thread1of1ForFork1_pop_#t~mem37#1_33|, t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_43|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_33|, t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, t2Thread1of1ForFork1_pop_#t~ret36#1=|v_t2Thread1of1ForFork1_pop_#t~ret36#1_37|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_43|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_17|, ~top~0=v_~top~0_108, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_33|, ~#arr~0.base=|v_~#arr~0.base_47|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_37|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_#t~mem37#1, t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_#in~stack#1.offset, t2Thread1of1ForFork1_#t~nondet43#1, t2Thread1of1ForFork1_pop_#t~ret36#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#in~stack#1.base, t2Thread1of1ForFork1_pop_#res#1] and [656] L969-3-->L979: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_76| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_120|) (= v_~top~0_377 0) (= |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_176| v_~top~0_377) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_120| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_76|)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_76|, ~top~0=v_~top~0_377, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_76|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_120|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_196|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_76|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_120|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_41|, ~top~0=v_~top~0_377, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_76|, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_176|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t1Thread1of1ForFork0_push_#t~ret34#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-13 00:31:43,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L1008-1-->L974: Formula: (and (= |v_~#arr~0.base_47| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_33|) (< 0 v_~top~0_108) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_33| |v_~#arr~0.offset_47|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_47|, ~top~0=v_~top~0_108, ~#arr~0.base=|v_~#arr~0.base_47|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_47|, t2Thread1of1ForFork1_pop_#t~mem37#1=|v_t2Thread1of1ForFork1_pop_#t~mem37#1_33|, t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_43|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_33|, t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, t2Thread1of1ForFork1_pop_#t~ret36#1=|v_t2Thread1of1ForFork1_pop_#t~ret36#1_37|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_43|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_17|, ~top~0=v_~top~0_108, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_33|, ~#arr~0.base=|v_~#arr~0.base_47|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_37|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_#t~mem37#1, t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_#in~stack#1.offset, t2Thread1of1ForFork1_#t~nondet43#1, t2Thread1of1ForFork1_pop_#t~ret36#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#in~stack#1.base, t2Thread1of1ForFork1_pop_#res#1] and [648] L969-3-->L1011-3: Formula: (and (= 0 (+ 2 |v_t2Thread1of1ForFork1_pop_#res#1_89|)) (= |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_158| v_~top~0_353) (= v_~top~0_353 0) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_114| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_70|) (= |v_t2Thread1of1ForFork1_#t~ret44#1_81| |v_t2Thread1of1ForFork1_pop_#res#1_89|) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_70| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_114|)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_70|, ~top~0=v_~top~0_353, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_70|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_114|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_180|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_70|, t2Thread1of1ForFork1_#t~ret44#1=|v_t2Thread1of1ForFork1_#t~ret44#1_81|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_114|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_37|, ~top~0=v_~top~0_353, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_70|, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_158|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_89|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t1Thread1of1ForFork0_push_#t~ret34#1, t2Thread1of1ForFork1_#t~ret44#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t1Thread1of1ForFork0_inc_top_#t~post31#1, t2Thread1of1ForFork1_pop_#res#1] [2022-12-13 00:31:43,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L1008-1-->L974: Formula: (and (= |v_~#arr~0.base_47| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_33|) (< 0 v_~top~0_108) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_33| |v_~#arr~0.offset_47|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_47|, ~top~0=v_~top~0_108, ~#arr~0.base=|v_~#arr~0.base_47|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_47|, t2Thread1of1ForFork1_pop_#t~mem37#1=|v_t2Thread1of1ForFork1_pop_#t~mem37#1_33|, t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_43|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_33|, t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, t2Thread1of1ForFork1_pop_#t~ret36#1=|v_t2Thread1of1ForFork1_pop_#t~ret36#1_37|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_43|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_17|, ~top~0=v_~top~0_108, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_33|, ~#arr~0.base=|v_~#arr~0.base_47|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_37|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_#t~mem37#1, t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_#in~stack#1.offset, t2Thread1of1ForFork1_#t~nondet43#1, t2Thread1of1ForFork1_pop_#t~ret36#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#in~stack#1.base, t2Thread1of1ForFork1_pop_#res#1] and [649] L969-3-->pop_returnLabel#1: Formula: (and (= (+ 2 |v_t2Thread1of1ForFork1_pop_#res#1_91|) 0) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_116| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_72|) (= v_~top~0_355 0) (= |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_160| v_~top~0_355) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_72| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_116|)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_72|, ~top~0=v_~top~0_355, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_72|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_116|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_182|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_72|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_116|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_39|, ~top~0=v_~top~0_355, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_72|, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_160|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_91|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t1Thread1of1ForFork0_push_#t~ret34#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t1Thread1of1ForFork0_inc_top_#t~post31#1, t2Thread1of1ForFork1_pop_#res#1] [2022-12-13 00:31:43,811 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:31:43,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-13 00:31:43,813 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 179 transitions, 780 flow [2022-12-13 00:31:43,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:43,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:43,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:43,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:31:43,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1159283603, now seen corresponding path program 1 times [2022-12-13 00:31:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:43,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458166267] [2022-12-13 00:31:43,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:43,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458166267] [2022-12-13 00:31:43,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458166267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:43,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:43,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:31:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820496846] [2022-12-13 00:31:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:43,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:31:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:31:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:31:43,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 118 [2022-12-13 00:31:43,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 179 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:43,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:43,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 118 [2022-12-13 00:31:43,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:45,200 INFO L130 PetriNetUnfolder]: 11813/20694 cut-off events. [2022-12-13 00:31:45,201 INFO L131 PetriNetUnfolder]: For 1618/1618 co-relation queries the response was YES. [2022-12-13 00:31:45,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45756 conditions, 20694 events. 11813/20694 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 158846 event pairs, 1773 based on Foata normal form. 288/8552 useless extension candidates. Maximal degree in co-relation 41458. Up to 16360 conditions per place. [2022-12-13 00:31:45,247 INFO L137 encePairwiseOnDemand]: 96/118 looper letters, 71 selfloop transitions, 8 changer transitions 64/160 dead transitions. [2022-12-13 00:31:45,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 160 transitions, 857 flow [2022-12-13 00:31:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:31:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:31:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-12-13 00:31:45,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4858757062146893 [2022-12-13 00:31:45,249 INFO L175 Difference]: Start difference. First operand has 123 places, 179 transitions, 780 flow. Second operand 3 states and 172 transitions. [2022-12-13 00:31:45,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 160 transitions, 857 flow [2022-12-13 00:31:45,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 160 transitions, 857 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:31:45,258 INFO L231 Difference]: Finished difference. Result has 119 places, 76 transitions, 291 flow [2022-12-13 00:31:45,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=119, PETRI_TRANSITIONS=76} [2022-12-13 00:31:45,259 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2022-12-13 00:31:45,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:45,259 INFO L89 Accepts]: Start accepts. Operand has 119 places, 76 transitions, 291 flow [2022-12-13 00:31:45,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:45,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:45,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 76 transitions, 291 flow [2022-12-13 00:31:45,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 76 transitions, 291 flow [2022-12-13 00:31:45,291 INFO L130 PetriNetUnfolder]: 73/578 cut-off events. [2022-12-13 00:31:45,291 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 00:31:45,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 578 events. 73/578 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4070 event pairs, 0 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 917. Up to 66 conditions per place. [2022-12-13 00:31:45,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 76 transitions, 291 flow [2022-12-13 00:31:45,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 1694 [2022-12-13 00:31:46,759 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 00:31:46,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1501 [2022-12-13 00:31:46,760 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 299 flow [2022-12-13 00:31:46,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:46,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:46,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:46,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:31:46,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash 148614468, now seen corresponding path program 1 times [2022-12-13 00:31:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:46,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680405852] [2022-12-13 00:31:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:47,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:47,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680405852] [2022-12-13 00:31:47,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680405852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:47,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:47,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:31:47,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820272558] [2022-12-13 00:31:47,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:47,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:31:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:31:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:31:47,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-13 00:31:47,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 299 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:47,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:47,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-13 00:31:47,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:49,012 INFO L130 PetriNetUnfolder]: 8811/16098 cut-off events. [2022-12-13 00:31:49,012 INFO L131 PetriNetUnfolder]: For 3386/3386 co-relation queries the response was YES. [2022-12-13 00:31:49,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38494 conditions, 16098 events. 8811/16098 cut-off events. For 3386/3386 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 124026 event pairs, 3334 based on Foata normal form. 0/9644 useless extension candidates. Maximal degree in co-relation 26262. Up to 6621 conditions per place. [2022-12-13 00:31:49,187 INFO L137 encePairwiseOnDemand]: 47/64 looper letters, 159 selfloop transitions, 19 changer transitions 37/224 dead transitions. [2022-12-13 00:31:49,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 224 transitions, 1271 flow [2022-12-13 00:31:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:31:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:31:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 280 transitions. [2022-12-13 00:31:49,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.546875 [2022-12-13 00:31:49,189 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 299 flow. Second operand 8 states and 280 transitions. [2022-12-13 00:31:49,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 224 transitions, 1271 flow [2022-12-13 00:31:49,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 224 transitions, 1233 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:31:49,202 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 438 flow [2022-12-13 00:31:49,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=438, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2022-12-13 00:31:49,203 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -36 predicate places. [2022-12-13 00:31:49,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:49,203 INFO L89 Accepts]: Start accepts. Operand has 75 places, 80 transitions, 438 flow [2022-12-13 00:31:49,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:49,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:49,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 80 transitions, 438 flow [2022-12-13 00:31:49,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 80 transitions, 438 flow [2022-12-13 00:31:49,258 INFO L130 PetriNetUnfolder]: 139/1092 cut-off events. [2022-12-13 00:31:49,258 INFO L131 PetriNetUnfolder]: For 407/407 co-relation queries the response was YES. [2022-12-13 00:31:49,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 1092 events. 139/1092 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9663 event pairs, 0 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 1081. Up to 194 conditions per place. [2022-12-13 00:31:49,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 80 transitions, 438 flow [2022-12-13 00:31:49,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 1664 [2022-12-13 00:31:49,897 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:31:49,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 695 [2022-12-13 00:31:49,898 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 79 transitions, 441 flow [2022-12-13 00:31:49,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:49,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:49,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:49,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:31:49,899 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:49,899 INFO L85 PathProgramCache]: Analyzing trace with hash -100268405, now seen corresponding path program 1 times [2022-12-13 00:31:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:49,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531803588] [2022-12-13 00:31:49,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:50,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:50,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531803588] [2022-12-13 00:31:50,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531803588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:50,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:50,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:31:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741158727] [2022-12-13 00:31:50,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:50,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:31:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:50,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:31:50,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:31:50,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2022-12-13 00:31:50,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 79 transitions, 441 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:50,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:50,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2022-12-13 00:31:50,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:51,684 INFO L130 PetriNetUnfolder]: 7306/13342 cut-off events. [2022-12-13 00:31:51,685 INFO L131 PetriNetUnfolder]: For 7190/7190 co-relation queries the response was YES. [2022-12-13 00:31:51,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32615 conditions, 13342 events. 7306/13342 cut-off events. For 7190/7190 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 101393 event pairs, 2299 based on Foata normal form. 0/7970 useless extension candidates. Maximal degree in co-relation 21146. Up to 9259 conditions per place. [2022-12-13 00:31:51,733 INFO L137 encePairwiseOnDemand]: 48/59 looper letters, 124 selfloop transitions, 14 changer transitions 6/153 dead transitions. [2022-12-13 00:31:51,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 153 transitions, 963 flow [2022-12-13 00:31:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:31:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:31:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2022-12-13 00:31:51,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.519774011299435 [2022-12-13 00:31:51,735 INFO L175 Difference]: Start difference. First operand has 69 places, 79 transitions, 441 flow. Second operand 6 states and 184 transitions. [2022-12-13 00:31:51,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 153 transitions, 963 flow [2022-12-13 00:31:51,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 939 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-13 00:31:51,750 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 540 flow [2022-12-13 00:31:51,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2022-12-13 00:31:51,751 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -35 predicate places. [2022-12-13 00:31:51,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:51,752 INFO L89 Accepts]: Start accepts. Operand has 76 places, 85 transitions, 540 flow [2022-12-13 00:31:51,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:51,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:51,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 85 transitions, 540 flow [2022-12-13 00:31:51,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 85 transitions, 540 flow [2022-12-13 00:31:51,815 INFO L130 PetriNetUnfolder]: 131/903 cut-off events. [2022-12-13 00:31:51,815 INFO L131 PetriNetUnfolder]: For 640/642 co-relation queries the response was YES. [2022-12-13 00:31:51,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 903 events. 131/903 cut-off events. For 640/642 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7679 event pairs, 0 based on Foata normal form. 2/512 useless extension candidates. Maximal degree in co-relation 1113. Up to 182 conditions per place. [2022-12-13 00:31:51,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 85 transitions, 540 flow [2022-12-13 00:31:51,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 1754 [2022-12-13 00:31:52,047 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:31:52,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-13 00:31:52,048 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 543 flow [2022-12-13 00:31:52,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:52,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:52,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:52,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:31:52,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash -74144685, now seen corresponding path program 2 times [2022-12-13 00:31:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:52,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587170349] [2022-12-13 00:31:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:52,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:52,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587170349] [2022-12-13 00:31:52,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587170349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:52,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:52,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:31:52,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692870320] [2022-12-13 00:31:52,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:52,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:31:52,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:31:52,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:31:52,618 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2022-12-13 00:31:52,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 543 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:52,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:52,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2022-12-13 00:31:52,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:54,134 INFO L130 PetriNetUnfolder]: 10090/18408 cut-off events. [2022-12-13 00:31:54,134 INFO L131 PetriNetUnfolder]: For 11913/11913 co-relation queries the response was YES. [2022-12-13 00:31:54,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45166 conditions, 18408 events. 10090/18408 cut-off events. For 11913/11913 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 149265 event pairs, 3287 based on Foata normal form. 0/11047 useless extension candidates. Maximal degree in co-relation 27687. Up to 7477 conditions per place. [2022-12-13 00:31:54,204 INFO L137 encePairwiseOnDemand]: 46/59 looper letters, 152 selfloop transitions, 34 changer transitions 6/201 dead transitions. [2022-12-13 00:31:54,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 201 transitions, 1342 flow [2022-12-13 00:31:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:31:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:31:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2022-12-13 00:31:54,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5190677966101694 [2022-12-13 00:31:54,206 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 543 flow. Second operand 8 states and 245 transitions. [2022-12-13 00:31:54,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 201 transitions, 1342 flow [2022-12-13 00:31:54,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 201 transitions, 1327 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:31:54,229 INFO L231 Difference]: Finished difference. Result has 83 places, 96 transitions, 762 flow [2022-12-13 00:31:54,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=762, PETRI_PLACES=83, PETRI_TRANSITIONS=96} [2022-12-13 00:31:54,230 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -28 predicate places. [2022-12-13 00:31:54,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:54,230 INFO L89 Accepts]: Start accepts. Operand has 83 places, 96 transitions, 762 flow [2022-12-13 00:31:54,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:54,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:54,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 96 transitions, 762 flow [2022-12-13 00:31:54,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 96 transitions, 762 flow [2022-12-13 00:31:54,313 INFO L130 PetriNetUnfolder]: 192/1238 cut-off events. [2022-12-13 00:31:54,313 INFO L131 PetriNetUnfolder]: For 1774/1776 co-relation queries the response was YES. [2022-12-13 00:31:54,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 1238 events. 192/1238 cut-off events. For 1774/1776 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11680 event pairs, 4 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 1605. Up to 250 conditions per place. [2022-12-13 00:31:54,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 96 transitions, 762 flow [2022-12-13 00:31:54,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 1974 [2022-12-13 00:31:54,684 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:31:54,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 455 [2022-12-13 00:31:54,685 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 95 transitions, 762 flow [2022-12-13 00:31:54,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:54,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:54,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:54,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:31:54,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:54,686 INFO L85 PathProgramCache]: Analyzing trace with hash -930740345, now seen corresponding path program 1 times [2022-12-13 00:31:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:54,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071431715] [2022-12-13 00:31:54,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:31:54,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:54,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071431715] [2022-12-13 00:31:54,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071431715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:54,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:54,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:31:54,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316921074] [2022-12-13 00:31:54,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:54,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:31:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:54,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:31:54,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:31:54,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2022-12-13 00:31:54,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 95 transitions, 762 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:54,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:54,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2022-12-13 00:31:54,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:55,795 INFO L130 PetriNetUnfolder]: 6712/12290 cut-off events. [2022-12-13 00:31:55,795 INFO L131 PetriNetUnfolder]: For 13288/13288 co-relation queries the response was YES. [2022-12-13 00:31:55,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31991 conditions, 12290 events. 6712/12290 cut-off events. For 13288/13288 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 95261 event pairs, 2848 based on Foata normal form. 159/7348 useless extension candidates. Maximal degree in co-relation 21733. Up to 4829 conditions per place. [2022-12-13 00:31:55,842 INFO L137 encePairwiseOnDemand]: 46/59 looper letters, 112 selfloop transitions, 30 changer transitions 0/151 dead transitions. [2022-12-13 00:31:55,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 151 transitions, 1119 flow [2022-12-13 00:31:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:31:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:31:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2022-12-13 00:31:55,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5661016949152542 [2022-12-13 00:31:55,844 INFO L175 Difference]: Start difference. First operand has 82 places, 95 transitions, 762 flow. Second operand 5 states and 167 transitions. [2022-12-13 00:31:55,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 151 transitions, 1119 flow [2022-12-13 00:31:55,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 151 transitions, 1078 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 00:31:55,884 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 747 flow [2022-12-13 00:31:55,884 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2022-12-13 00:31:55,884 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -25 predicate places. [2022-12-13 00:31:55,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:55,885 INFO L89 Accepts]: Start accepts. Operand has 86 places, 90 transitions, 747 flow [2022-12-13 00:31:55,888 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:55,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:55,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 90 transitions, 747 flow [2022-12-13 00:31:55,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 90 transitions, 747 flow [2022-12-13 00:31:55,968 INFO L130 PetriNetUnfolder]: 120/844 cut-off events. [2022-12-13 00:31:55,968 INFO L131 PetriNetUnfolder]: For 2207/2208 co-relation queries the response was YES. [2022-12-13 00:31:55,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 844 events. 120/844 cut-off events. For 2207/2208 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7366 event pairs, 0 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 1438. Up to 182 conditions per place. [2022-12-13 00:31:55,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 90 transitions, 747 flow [2022-12-13 00:31:55,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 1850 [2022-12-13 00:31:56,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L969-3-->L946-1: Formula: (= v_~top~0_45 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|) InVars {~top~0=v_~top~0_45} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_27|, ~top~0=v_~top~0_45, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_29|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [612] L1022-4-->L1023-3: Formula: (and (= (store |v_#memory_int_133| |v_ULTIMATE.start_main_~#id2~0#1.base_17| (store (select |v_#memory_int_133| |v_ULTIMATE.start_main_~#id2~0#1.base_17|) |v_ULTIMATE.start_main_~#id2~0#1.offset_17| |v_ULTIMATE.start_main_#t~pre47#1_17|)) |v_#memory_int_132|) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre47#1_17|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_34|, #memory_int=|v_#memory_int_133|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_9|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_33|, #memory_int=|v_#memory_int_132|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_17|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-13 00:31:56,413 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [717] L969-3-->L1023-3: Formula: (and (= (store |v_#memory_int_276| |v_ULTIMATE.start_main_~#id2~0#1.base_33| (store (select |v_#memory_int_276| |v_ULTIMATE.start_main_~#id2~0#1.base_33|) |v_ULTIMATE.start_main_~#id2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre47#1_31|)) |v_#memory_int_275|) (= |v_#pthreadsForks_58| |v_ULTIMATE.start_main_#t~pre47#1_31|) (= |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_226| v_~top~0_593) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_276|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_33|, ~top~0=v_~top~0_593} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_23|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_57|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_238|, #memory_int=|v_#memory_int_275|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_31|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_33|, ~top~0=v_~top~0_593, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_226|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, ULTIMATE.start_main_#t~pre47#1, t1Thread1of1ForFork0_inc_top_#t~post31#1, ULTIMATE.start_main_#t~pre45#1] and [582] L946-1-->push_returnLabel#1: Formula: (and (= v_~top~0_102 (+ 1 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_50|)) (= |v_t1Thread1of1ForFork0_push_#res#1_37| 0)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_50|} OutVars{t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_37|, ~top~0=v_~top~0_102} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, ~top~0, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-13 00:31:56,820 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 00:31:56,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 936 [2022-12-13 00:31:56,821 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 726 flow [2022-12-13 00:31:56,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:56,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:56,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:56,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:31:56,822 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1175324172, now seen corresponding path program 1 times [2022-12-13 00:31:56,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:56,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551488730] [2022-12-13 00:31:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:56,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551488730] [2022-12-13 00:31:57,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551488730] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:31:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578479936] [2022-12-13 00:31:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:57,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:57,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:57,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:31:57,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 00:31:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:57,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 00:31:57,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:31:57,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 00:31:57,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-13 00:31:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:59,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:31:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:31:59,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578479936] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 00:31:59,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 00:31:59,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 17 [2022-12-13 00:31:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669255502] [2022-12-13 00:31:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:59,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:31:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:31:59,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=253, Unknown=1, NotChecked=0, Total=306 [2022-12-13 00:31:59,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 65 [2022-12-13 00:31:59,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 726 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:59,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:59,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 65 [2022-12-13 00:31:59,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:01,459 INFO L130 PetriNetUnfolder]: 8654/15905 cut-off events. [2022-12-13 00:32:01,459 INFO L131 PetriNetUnfolder]: For 26361/26361 co-relation queries the response was YES. [2022-12-13 00:32:01,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42564 conditions, 15905 events. 8654/15905 cut-off events. For 26361/26361 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 131678 event pairs, 2551 based on Foata normal form. 0/9342 useless extension candidates. Maximal degree in co-relation 29869. Up to 4925 conditions per place. [2022-12-13 00:32:01,548 INFO L137 encePairwiseOnDemand]: 44/65 looper letters, 142 selfloop transitions, 44 changer transitions 11/206 dead transitions. [2022-12-13 00:32:01,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 206 transitions, 1630 flow [2022-12-13 00:32:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:32:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:32:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2022-12-13 00:32:01,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2022-12-13 00:32:01,551 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 726 flow. Second operand 8 states and 250 transitions. [2022-12-13 00:32:01,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 206 transitions, 1630 flow [2022-12-13 00:32:01,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 206 transitions, 1561 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-13 00:32:01,606 INFO L231 Difference]: Finished difference. Result has 88 places, 102 transitions, 1043 flow [2022-12-13 00:32:01,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1043, PETRI_PLACES=88, PETRI_TRANSITIONS=102} [2022-12-13 00:32:01,607 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -23 predicate places. [2022-12-13 00:32:01,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:01,607 INFO L89 Accepts]: Start accepts. Operand has 88 places, 102 transitions, 1043 flow [2022-12-13 00:32:01,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:01,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:01,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 102 transitions, 1043 flow [2022-12-13 00:32:01,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 102 transitions, 1043 flow [2022-12-13 00:32:01,666 INFO L130 PetriNetUnfolder]: 151/1090 cut-off events. [2022-12-13 00:32:01,666 INFO L131 PetriNetUnfolder]: For 3557/3562 co-relation queries the response was YES. [2022-12-13 00:32:01,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1090 events. 151/1090 cut-off events. For 3557/3562 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10431 event pairs, 0 based on Foata normal form. 1/547 useless extension candidates. Maximal degree in co-relation 1976. Up to 230 conditions per place. [2022-12-13 00:32:01,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 102 transitions, 1043 flow [2022-12-13 00:32:01,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 2000 [2022-12-13 00:32:02,398 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:32:02,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 791 [2022-12-13 00:32:02,399 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 1048 flow [2022-12-13 00:32:02,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:02,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:02,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:02,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 00:32:02,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 00:32:02,605 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash 763036247, now seen corresponding path program 1 times [2022-12-13 00:32:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:02,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633860633] [2022-12-13 00:32:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:03,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:03,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633860633] [2022-12-13 00:32:03,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633860633] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:03,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212062818] [2022-12-13 00:32:03,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:03,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:03,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:03,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:32:03,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 00:32:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:03,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 00:32:03,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:03,308 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 00:32:03,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 00:32:03,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 00:32:03,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2022-12-13 00:32:03,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 46 [2022-12-13 00:32:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:03,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:03,859 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_278) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) is different from false [2022-12-13 00:32:03,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:32:03,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 00:32:03,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-13 00:32:03,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-13 00:32:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-13 00:32:03,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212062818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:03,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:03,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 14 [2022-12-13 00:32:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243173669] [2022-12-13 00:32:03,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:03,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 00:32:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:03,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 00:32:03,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=164, Unknown=1, NotChecked=26, Total=240 [2022-12-13 00:32:03,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 68 [2022-12-13 00:32:03,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 1048 flow. Second operand has 16 states, 16 states have (on average 11.1875) internal successors, (179), 16 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:03,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:03,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 68 [2022-12-13 00:32:03,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:06,427 INFO L130 PetriNetUnfolder]: 10516/19299 cut-off events. [2022-12-13 00:32:06,427 INFO L131 PetriNetUnfolder]: For 43030/43030 co-relation queries the response was YES. [2022-12-13 00:32:06,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54081 conditions, 19299 events. 10516/19299 cut-off events. For 43030/43030 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 162424 event pairs, 3249 based on Foata normal form. 333/11461 useless extension candidates. Maximal degree in co-relation 35884. Up to 7823 conditions per place. [2022-12-13 00:32:06,548 INFO L137 encePairwiseOnDemand]: 24/68 looper letters, 180 selfloop transitions, 54 changer transitions 8/251 dead transitions. [2022-12-13 00:32:06,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 251 transitions, 2135 flow [2022-12-13 00:32:06,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 00:32:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 00:32:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 308 transitions. [2022-12-13 00:32:06,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45294117647058824 [2022-12-13 00:32:06,550 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 1048 flow. Second operand 10 states and 308 transitions. [2022-12-13 00:32:06,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 251 transitions, 2135 flow [2022-12-13 00:32:06,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 251 transitions, 2073 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-13 00:32:06,641 INFO L231 Difference]: Finished difference. Result has 100 places, 131 transitions, 1489 flow [2022-12-13 00:32:06,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1489, PETRI_PLACES=100, PETRI_TRANSITIONS=131} [2022-12-13 00:32:06,642 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -11 predicate places. [2022-12-13 00:32:06,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:06,642 INFO L89 Accepts]: Start accepts. Operand has 100 places, 131 transitions, 1489 flow [2022-12-13 00:32:06,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:06,644 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:06,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 131 transitions, 1489 flow [2022-12-13 00:32:06,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 131 transitions, 1489 flow [2022-12-13 00:32:07,037 INFO L130 PetriNetUnfolder]: 2907/7323 cut-off events. [2022-12-13 00:32:07,037 INFO L131 PetriNetUnfolder]: For 14928/14959 co-relation queries the response was YES. [2022-12-13 00:32:07,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19471 conditions, 7323 events. 2907/7323 cut-off events. For 14928/14959 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 74001 event pairs, 2113 based on Foata normal form. 6/3769 useless extension candidates. Maximal degree in co-relation 17143. Up to 4790 conditions per place. [2022-12-13 00:32:07,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 131 transitions, 1489 flow [2022-12-13 00:32:07,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 2214 [2022-12-13 00:32:09,180 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:32:09,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2539 [2022-12-13 00:32:09,182 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 130 transitions, 1564 flow [2022-12-13 00:32:09,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.1875) internal successors, (179), 16 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:09,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:09,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:09,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 00:32:09,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:09,389 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1195464020, now seen corresponding path program 2 times [2022-12-13 00:32:09,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:09,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167951994] [2022-12-13 00:32:09,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:09,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167951994] [2022-12-13 00:32:09,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167951994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271471885] [2022-12-13 00:32:09,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 00:32:09,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:09,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:32:09,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 00:32:10,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 00:32:10,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 00:32:10,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 00:32:10,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:10,055 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 00:32:10,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 00:32:10,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 00:32:10,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-13 00:32:10,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 00:32:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:10,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:10,509 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_332) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-12-13 00:32:10,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:32:10,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 00:32:10,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-13 00:32:10,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-13 00:32:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:10,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271471885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:10,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:10,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-13 00:32:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853802541] [2022-12-13 00:32:10,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:10,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 00:32:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:10,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 00:32:10,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2022-12-13 00:32:10,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 72 [2022-12-13 00:32:10,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 130 transitions, 1564 flow. Second operand has 21 states, 21 states have (on average 11.142857142857142) internal successors, (234), 21 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:10,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:10,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 72 [2022-12-13 00:32:10,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:14,659 INFO L130 PetriNetUnfolder]: 15823/29062 cut-off events. [2022-12-13 00:32:14,660 INFO L131 PetriNetUnfolder]: For 87734/87734 co-relation queries the response was YES. [2022-12-13 00:32:14,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103744 conditions, 29062 events. 15823/29062 cut-off events. For 87734/87734 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 248443 event pairs, 3585 based on Foata normal form. 0/17432 useless extension candidates. Maximal degree in co-relation 84251. Up to 17018 conditions per place. [2022-12-13 00:32:14,803 INFO L137 encePairwiseOnDemand]: 30/72 looper letters, 254 selfloop transitions, 130 changer transitions 21/414 dead transitions. [2022-12-13 00:32:14,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 414 transitions, 4199 flow [2022-12-13 00:32:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 00:32:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 00:32:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 500 transitions. [2022-12-13 00:32:14,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4084967320261438 [2022-12-13 00:32:14,806 INFO L175 Difference]: Start difference. First operand has 99 places, 130 transitions, 1564 flow. Second operand 17 states and 500 transitions. [2022-12-13 00:32:14,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 414 transitions, 4199 flow [2022-12-13 00:32:14,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 414 transitions, 4119 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-13 00:32:14,947 INFO L231 Difference]: Finished difference. Result has 119 places, 207 transitions, 2836 flow [2022-12-13 00:32:14,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2836, PETRI_PLACES=119, PETRI_TRANSITIONS=207} [2022-12-13 00:32:14,947 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2022-12-13 00:32:14,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:14,947 INFO L89 Accepts]: Start accepts. Operand has 119 places, 207 transitions, 2836 flow [2022-12-13 00:32:14,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:14,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:14,949 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 207 transitions, 2836 flow [2022-12-13 00:32:14,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 207 transitions, 2836 flow [2022-12-13 00:32:15,973 INFO L130 PetriNetUnfolder]: 5981/13792 cut-off events. [2022-12-13 00:32:15,973 INFO L131 PetriNetUnfolder]: For 58382/59761 co-relation queries the response was YES. [2022-12-13 00:32:16,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62265 conditions, 13792 events. 5981/13792 cut-off events. For 58382/59761 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 136516 event pairs, 3011 based on Foata normal form. 64/7617 useless extension candidates. Maximal degree in co-relation 50923. Up to 8450 conditions per place. [2022-12-13 00:32:16,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 207 transitions, 2836 flow [2022-12-13 00:32:16,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 2770 [2022-12-13 00:32:16,515 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:32:16,516 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1569 [2022-12-13 00:32:16,516 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 206 transitions, 2838 flow [2022-12-13 00:32:16,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.142857142857142) internal successors, (234), 21 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:16,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:16,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:16,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 00:32:16,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:16,724 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash -304406085, now seen corresponding path program 1 times [2022-12-13 00:32:16,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:16,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030684178] [2022-12-13 00:32:16,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:17,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:17,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030684178] [2022-12-13 00:32:17,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030684178] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:17,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354641931] [2022-12-13 00:32:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:17,197 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:32:17,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 00:32:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:17,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 00:32:17,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:17,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 00:32:17,608 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-13 00:32:17,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50 [2022-12-13 00:32:17,846 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 00:32:17,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 52 [2022-12-13 00:32:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:17,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:18,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 00:32:18,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 90 [2022-12-13 00:32:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:18,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354641931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:18,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:18,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2022-12-13 00:32:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902838246] [2022-12-13 00:32:18,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:18,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 00:32:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:18,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 00:32:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-12-13 00:32:18,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 74 [2022-12-13 00:32:18,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 206 transitions, 2838 flow. Second operand has 19 states, 19 states have (on average 11.210526315789474) internal successors, (213), 19 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:18,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:18,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 74 [2022-12-13 00:32:18,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:26,697 INFO L130 PetriNetUnfolder]: 28786/52970 cut-off events. [2022-12-13 00:32:26,697 INFO L131 PetriNetUnfolder]: For 259876/259876 co-relation queries the response was YES. [2022-12-13 00:32:27,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279987 conditions, 52970 events. 28786/52970 cut-off events. For 259876/259876 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 482251 event pairs, 6358 based on Foata normal form. 164/31936 useless extension candidates. Maximal degree in co-relation 215083. Up to 31038 conditions per place. [2022-12-13 00:32:27,246 INFO L137 encePairwiseOnDemand]: 42/74 looper letters, 506 selfloop transitions, 180 changer transitions 129/824 dead transitions. [2022-12-13 00:32:27,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 824 transitions, 10315 flow [2022-12-13 00:32:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 00:32:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 00:32:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 732 transitions. [2022-12-13 00:32:27,250 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3956756756756757 [2022-12-13 00:32:27,250 INFO L175 Difference]: Start difference. First operand has 118 places, 206 transitions, 2838 flow. Second operand 25 states and 732 transitions. [2022-12-13 00:32:27,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 824 transitions, 10315 flow [2022-12-13 00:32:28,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 824 transitions, 9601 flow, removed 355 selfloop flow, removed 3 redundant places. [2022-12-13 00:32:28,050 INFO L231 Difference]: Finished difference. Result has 152 places, 317 transitions, 5151 flow [2022-12-13 00:32:28,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=2588, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5151, PETRI_PLACES=152, PETRI_TRANSITIONS=317} [2022-12-13 00:32:28,050 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 41 predicate places. [2022-12-13 00:32:28,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:28,051 INFO L89 Accepts]: Start accepts. Operand has 152 places, 317 transitions, 5151 flow [2022-12-13 00:32:28,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:28,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:28,053 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 317 transitions, 5151 flow [2022-12-13 00:32:28,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 317 transitions, 5151 flow [2022-12-13 00:32:30,414 INFO L130 PetriNetUnfolder]: 10671/23874 cut-off events. [2022-12-13 00:32:30,414 INFO L131 PetriNetUnfolder]: For 108705/111275 co-relation queries the response was YES. [2022-12-13 00:32:30,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111489 conditions, 23874 events. 10671/23874 cut-off events. For 108705/111275 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 246884 event pairs, 7320 based on Foata normal form. 52/13254 useless extension candidates. Maximal degree in co-relation 108544. Up to 14230 conditions per place. [2022-12-13 00:32:30,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 317 transitions, 5151 flow [2022-12-13 00:32:30,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 4658 [2022-12-13 00:32:31,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] L22-1-->L969-3: Formula: (and (not (= 5 v_~top~0_495)) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_220| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_128| |v_t1Thread1of1ForFork0_push_#t~ret34#1_220|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.base_88| |v_~#arr~0.base_165|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.base_88| |v_t1Thread1of1ForFork0_push_~stack#1.base_148|) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_220| 2147483647) (= (store |v_#memory_int_236| |v_t1Thread1of1ForFork0_push_~stack#1.base_148| (store (select |v_#memory_int_236| |v_t1Thread1of1ForFork0_push_~stack#1.base_148|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_220| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_148|) |v_t1Thread1of1ForFork0_push_~x#1_146|)) |v_#memory_int_235|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_88| |v_t1Thread1of1ForFork0_push_~stack#1.offset_148|) (= (let ((.cse0 (mod |v_t1Thread1of1ForFork0_~tmp~0#1_159| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_t1Thread1of1ForFork0_push_#in~x#1_88|) (= |v_t1Thread1of1ForFork0_get_top_#res#1_128| v_~top~0_495) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_88| |v_~#arr~0.offset_165|) (= |v_t1Thread1of1ForFork0_push_~x#1_146| |v_t1Thread1of1ForFork0_push_#in~x#1_88|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_165|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_159|, #memory_int=|v_#memory_int_236|, ~top~0=v_~top~0_495, ~#arr~0.base=|v_~#arr~0.base_165|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_165|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_146|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_220|, t1Thread1of1ForFork0_push_#in~stack#1.offset=|v_t1Thread1of1ForFork0_push_#in~stack#1.offset_88|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_128|, ~top~0=v_~top~0_495, t1Thread1of1ForFork0_push_#in~x#1=|v_t1Thread1of1ForFork0_push_#in~x#1_88|, t1Thread1of1ForFork0_push_#in~stack#1.base=|v_t1Thread1of1ForFork0_push_#in~stack#1.base_88|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_147|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_159|, #memory_int=|v_#memory_int_235|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_148|, t1Thread1of1ForFork0_push_#t~nondet33#1=|v_t1Thread1of1ForFork0_push_#t~nondet33#1_88|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_148|, ~#arr~0.base=|v_~#arr~0.base_165|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, t1Thread1of1ForFork0_push_~x#1, t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_push_~stack#1.base, t1Thread1of1ForFork0_push_#in~stack#1.offset, t1Thread1of1ForFork0_push_#t~nondet33#1, t1Thread1of1ForFork0_get_top_#res#1, t1Thread1of1ForFork0_push_#in~x#1, t1Thread1of1ForFork0_push_~stack#1.offset, t1Thread1of1ForFork0_push_#in~stack#1.base] and [526] L1023-4-->L1024: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_3|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-13 00:32:31,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] L22-1-->L969-3: Formula: (and (not (= 5 v_~top~0_495)) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_220| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_128| |v_t1Thread1of1ForFork0_push_#t~ret34#1_220|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.base_88| |v_~#arr~0.base_165|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.base_88| |v_t1Thread1of1ForFork0_push_~stack#1.base_148|) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_220| 2147483647) (= (store |v_#memory_int_236| |v_t1Thread1of1ForFork0_push_~stack#1.base_148| (store (select |v_#memory_int_236| |v_t1Thread1of1ForFork0_push_~stack#1.base_148|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_220| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_148|) |v_t1Thread1of1ForFork0_push_~x#1_146|)) |v_#memory_int_235|) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_88| |v_t1Thread1of1ForFork0_push_~stack#1.offset_148|) (= (let ((.cse0 (mod |v_t1Thread1of1ForFork0_~tmp~0#1_159| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_t1Thread1of1ForFork0_push_#in~x#1_88|) (= |v_t1Thread1of1ForFork0_get_top_#res#1_128| v_~top~0_495) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_88| |v_~#arr~0.offset_165|) (= |v_t1Thread1of1ForFork0_push_~x#1_146| |v_t1Thread1of1ForFork0_push_#in~x#1_88|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_165|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_159|, #memory_int=|v_#memory_int_236|, ~top~0=v_~top~0_495, ~#arr~0.base=|v_~#arr~0.base_165|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_165|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_146|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_220|, t1Thread1of1ForFork0_push_#in~stack#1.offset=|v_t1Thread1of1ForFork0_push_#in~stack#1.offset_88|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_128|, ~top~0=v_~top~0_495, t1Thread1of1ForFork0_push_#in~x#1=|v_t1Thread1of1ForFork0_push_#in~x#1_88|, t1Thread1of1ForFork0_push_#in~stack#1.base=|v_t1Thread1of1ForFork0_push_#in~stack#1.base_88|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_147|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_159|, #memory_int=|v_#memory_int_235|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_148|, t1Thread1of1ForFork0_push_#t~nondet33#1=|v_t1Thread1of1ForFork0_push_#t~nondet33#1_88|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_148|, ~#arr~0.base=|v_~#arr~0.base_165|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, t1Thread1of1ForFork0_push_~x#1, t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_push_~stack#1.base, t1Thread1of1ForFork0_push_#in~stack#1.offset, t1Thread1of1ForFork0_push_#t~nondet33#1, t1Thread1of1ForFork0_get_top_#res#1, t1Thread1of1ForFork0_push_#in~x#1, t1Thread1of1ForFork0_push_~stack#1.offset, t1Thread1of1ForFork0_push_#in~stack#1.base] and [580] L1023-4-->L1024-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_10| (select (select |v_#memory_int_100| |v_ULTIMATE.start_main_~#id1~0#1.base_15|) |v_ULTIMATE.start_main_~#id1~0#1.offset_15|)) InVars {#memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_10|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_5|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_13|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-13 00:32:32,965 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 00:32:32,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4917 [2022-12-13 00:32:32,967 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 313 transitions, 5151 flow [2022-12-13 00:32:32,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.210526315789474) internal successors, (213), 19 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:32,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:32,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:32,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 00:32:33,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 00:32:33,175 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:33,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash 126356275, now seen corresponding path program 1 times [2022-12-13 00:32:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:33,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388074199] [2022-12-13 00:32:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:33,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:34,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388074199] [2022-12-13 00:32:34,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388074199] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:34,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805237195] [2022-12-13 00:32:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:34,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:34,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:34,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:32:34,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 00:32:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:34,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 80 conjunts are in the unsatisfiable core [2022-12-13 00:32:34,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:34,218 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 00:32:34,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 00:32:34,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 00:32:34,436 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-13 00:32:34,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50 [2022-12-13 00:32:34,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2022-12-13 00:32:34,804 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 00:32:34,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 52 [2022-12-13 00:32:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:34,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:35,004 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_get_top_#res#1_182| Int) (v_ArrVal_442 (Array Int Int))) (or (not (< 0 |v_t2Thread1of1ForFork1_get_top_#res#1_182|)) (not (<= (+ |v_t2Thread1of1ForFork1_get_top_#res#1_182| 1) c_~top~0)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_442) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* |v_t2Thread1of1ForFork1_get_top_#res#1_182| 4))) 4294967296))))) is different from false [2022-12-13 00:32:35,289 INFO L321 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2022-12-13 00:32:35,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 54 [2022-12-13 00:32:35,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:32:35,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2022-12-13 00:32:35,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2022-12-13 00:32:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:35,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805237195] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:35,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:35,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-13 00:32:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467556779] [2022-12-13 00:32:35,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:35,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 00:32:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 00:32:35,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=344, Unknown=4, NotChecked=40, Total=506 [2022-12-13 00:32:35,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 85 [2022-12-13 00:32:35,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 313 transitions, 5151 flow. Second operand has 23 states, 23 states have (on average 10.826086956521738) internal successors, (249), 23 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:35,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:35,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 85 [2022-12-13 00:32:35,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:45,239 INFO L130 PetriNetUnfolder]: 30703/56730 cut-off events. [2022-12-13 00:32:45,240 INFO L131 PetriNetUnfolder]: For 311548/311548 co-relation queries the response was YES. [2022-12-13 00:32:45,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304757 conditions, 56730 events. 30703/56730 cut-off events. For 311548/311548 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 513783 event pairs, 6703 based on Foata normal form. 261/34331 useless extension candidates. Maximal degree in co-relation 294229. Up to 31881 conditions per place. [2022-12-13 00:32:45,876 INFO L137 encePairwiseOnDemand]: 46/85 looper letters, 431 selfloop transitions, 188 changer transitions 87/715 dead transitions. [2022-12-13 00:32:45,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 715 transitions, 9809 flow [2022-12-13 00:32:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 00:32:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 00:32:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 568 transitions. [2022-12-13 00:32:45,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3712418300653595 [2022-12-13 00:32:45,878 INFO L175 Difference]: Start difference. First operand has 148 places, 313 transitions, 5151 flow. Second operand 18 states and 568 transitions. [2022-12-13 00:32:45,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 715 transitions, 9809 flow [2022-12-13 00:32:47,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 715 transitions, 9493 flow, removed 129 selfloop flow, removed 4 redundant places. [2022-12-13 00:32:47,425 INFO L231 Difference]: Finished difference. Result has 173 places, 346 transitions, 6171 flow [2022-12-13 00:32:47,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=4591, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6171, PETRI_PLACES=173, PETRI_TRANSITIONS=346} [2022-12-13 00:32:47,426 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 62 predicate places. [2022-12-13 00:32:47,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:47,426 INFO L89 Accepts]: Start accepts. Operand has 173 places, 346 transitions, 6171 flow [2022-12-13 00:32:47,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:47,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:47,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 346 transitions, 6171 flow [2022-12-13 00:32:47,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 346 transitions, 6171 flow [2022-12-13 00:32:50,214 INFO L130 PetriNetUnfolder]: 11606/26125 cut-off events. [2022-12-13 00:32:50,215 INFO L131 PetriNetUnfolder]: For 145086/147631 co-relation queries the response was YES. [2022-12-13 00:32:50,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125626 conditions, 26125 events. 11606/26125 cut-off events. For 145086/147631 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 270016 event pairs, 7886 based on Foata normal form. 56/14547 useless extension candidates. Maximal degree in co-relation 118008. Up to 15367 conditions per place. [2022-12-13 00:32:50,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 346 transitions, 6171 flow [2022-12-13 00:32:50,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 5086 [2022-12-13 00:32:51,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:32:51,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3706 [2022-12-13 00:32:51,132 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 345 transitions, 6173 flow [2022-12-13 00:32:51,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.826086956521738) internal successors, (249), 23 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:51,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:51,132 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:51,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 00:32:51,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:51,333 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash -42859236, now seen corresponding path program 1 times [2022-12-13 00:32:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:51,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698694513] [2022-12-13 00:32:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:51,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:51,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:51,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698694513] [2022-12-13 00:32:51,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698694513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702167775] [2022-12-13 00:32:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:51,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:51,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:51,542 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:32:51,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 00:32:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:51,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 00:32:51,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:51,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:51,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702167775] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:51,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:51,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-12-13 00:32:51,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429820306] [2022-12-13 00:32:51,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:51,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 00:32:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:51,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 00:32:51,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-13 00:32:51,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 86 [2022-12-13 00:32:51,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 345 transitions, 6173 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:51,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:51,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 86 [2022-12-13 00:32:51,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:00,945 INFO L130 PetriNetUnfolder]: 29665/54927 cut-off events. [2022-12-13 00:33:00,945 INFO L131 PetriNetUnfolder]: For 365920/365920 co-relation queries the response was YES. [2022-12-13 00:33:01,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301625 conditions, 54927 events. 29665/54927 cut-off events. For 365920/365920 co-relation queries the response was YES. Maximal size of possible extension queue 1481. Compared 496270 event pairs, 11085 based on Foata normal form. 230/33140 useless extension candidates. Maximal degree in co-relation 290552. Up to 30706 conditions per place. [2022-12-13 00:33:01,697 INFO L137 encePairwiseOnDemand]: 46/86 looper letters, 398 selfloop transitions, 201 changer transitions 3/611 dead transitions. [2022-12-13 00:33:01,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 611 transitions, 9504 flow [2022-12-13 00:33:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 00:33:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 00:33:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 377 transitions. [2022-12-13 00:33:01,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3985200845665962 [2022-12-13 00:33:01,698 INFO L175 Difference]: Start difference. First operand has 172 places, 345 transitions, 6173 flow. Second operand 11 states and 377 transitions. [2022-12-13 00:33:01,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 611 transitions, 9504 flow [2022-12-13 00:33:03,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 611 transitions, 9136 flow, removed 121 selfloop flow, removed 9 redundant places. [2022-12-13 00:33:03,462 INFO L231 Difference]: Finished difference. Result has 178 places, 362 transitions, 6908 flow [2022-12-13 00:33:03,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=5609, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6908, PETRI_PLACES=178, PETRI_TRANSITIONS=362} [2022-12-13 00:33:03,462 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 67 predicate places. [2022-12-13 00:33:03,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:03,462 INFO L89 Accepts]: Start accepts. Operand has 178 places, 362 transitions, 6908 flow [2022-12-13 00:33:03,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:03,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:03,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 362 transitions, 6908 flow [2022-12-13 00:33:03,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 362 transitions, 6908 flow [2022-12-13 00:33:06,321 INFO L130 PetriNetUnfolder]: 11653/26547 cut-off events. [2022-12-13 00:33:06,321 INFO L131 PetriNetUnfolder]: For 179741/182250 co-relation queries the response was YES. [2022-12-13 00:33:06,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131661 conditions, 26547 events. 11653/26547 cut-off events. For 179741/182250 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 275640 event pairs, 7666 based on Foata normal form. 62/14930 useless extension candidates. Maximal degree in co-relation 112080. Up to 15137 conditions per place. [2022-12-13 00:33:06,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 362 transitions, 6908 flow [2022-12-13 00:33:06,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 5328 [2022-12-13 00:33:06,834 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:06,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3373 [2022-12-13 00:33:06,835 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 362 transitions, 6908 flow [2022-12-13 00:33:06,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:06,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:06,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:06,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 00:33:07,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:33:07,042 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:33:07,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1856292094, now seen corresponding path program 1 times [2022-12-13 00:33:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:07,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99797743] [2022-12-13 00:33:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:07,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:07,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99797743] [2022-12-13 00:33:07,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99797743] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:33:07,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641483758] [2022-12-13 00:33:07,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:07,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:33:07,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:33:07,581 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:33:07,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 00:33:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:07,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 00:33:07,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:33:07,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 00:33:07,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 00:33:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 00:33:08,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:33:08,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641483758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:08,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 00:33:08,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2022-12-13 00:33:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713821959] [2022-12-13 00:33:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:08,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:33:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:08,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:33:08,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-13 00:33:08,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 85 [2022-12-13 00:33:08,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 362 transitions, 6908 flow. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:08,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:08,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 85 [2022-12-13 00:33:08,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand