/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:04:21,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:04:21,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:04:21,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:04:21,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:04:21,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:04:21,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:04:21,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:04:21,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:04:21,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:04:21,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:04:21,437 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:04:21,438 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:04:21,438 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:04:21,438 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:04:21,439 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:04:21,439 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:04:21,439 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:04:21,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:04:21,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:04:21,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:04:21,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:04:21,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:04:21,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:04:21,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:04:21,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:04:21,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:04:21,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:04:21,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:04:21,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:04:21,444 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:04:21,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:04:21,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:04:21,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:04:21,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:04:21,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:04:21,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:04:21,446 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:04:21,446 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 00:04:21,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:04:21,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:04:21,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:04:21,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:04:21,771 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:04:21,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2024-02-10 00:04:23,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:04:23,381 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:04:23,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2024-02-10 00:04:23,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047f2e83c/9e3c63945a164fd2b610ce2f9901817c/FLAG2ee05a87c [2024-02-10 00:04:23,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047f2e83c/9e3c63945a164fd2b610ce2f9901817c [2024-02-10 00:04:23,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:04:23,411 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:04:23,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:04:23,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:04:23,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:04:23,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd30b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23, skipping insertion in model container [2024-02-10 00:04:23,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:04:23,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:04:23,739 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:04:23,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:04:23,771 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:04:23,771 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:04:23,777 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:04:23,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23 WrapperNode [2024-02-10 00:04:23,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:04:23,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:04:23,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:04:23,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:04:23,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,810 INFO L138 Inliner]: procedures = 22, calls = 38, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-02-10 00:04:23,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:04:23,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:04:23,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:04:23,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:04:23,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:04:23,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:04:23,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:04:23,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:04:23,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (1/1) ... [2024-02-10 00:04:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:23,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:04:23,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:04:23,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:04:23,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:04:23,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:04:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:04:23,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:04:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:04:23,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:04:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:04:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:04:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:04:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:04:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:04:23,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:04:23,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:04:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:04:23,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:04:23,992 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:04:24,076 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:04:24,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:04:24,377 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:04:24,410 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:04:24,410 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-10 00:04:24,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:04:24 BoogieIcfgContainer [2024-02-10 00:04:24,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:04:24,418 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:04:24,418 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:04:24,421 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:04:24,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:04:24,422 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:04:23" (1/3) ... [2024-02-10 00:04:24,423 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@658a01d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:04:24, skipping insertion in model container [2024-02-10 00:04:24,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:04:24,424 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:23" (2/3) ... [2024-02-10 00:04:24,424 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@658a01d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:04:24, skipping insertion in model container [2024-02-10 00:04:24,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:04:24,425 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:04:24" (3/3) ... [2024-02-10 00:04:24,428 INFO L332 chiAutomizerObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2024-02-10 00:04:24,573 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-10 00:04:24,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 133 transitions, 287 flow [2024-02-10 00:04:24,685 INFO L124 PetriNetUnfolderBase]: 16/127 cut-off events. [2024-02-10 00:04:24,685 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:04:24,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 16/127 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 4 conditions per place. [2024-02-10 00:04:24,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 133 transitions, 287 flow [2024-02-10 00:04:24,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 127 transitions, 272 flow [2024-02-10 00:04:24,709 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:04:24,710 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:04:24,710 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:04:24,710 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:04:24,710 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:04:24,710 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:04:24,710 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:04:24,710 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:04:24,710 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:04:24,711 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 121 places, 127 transitions, 272 flow [2024-02-10 00:04:25,561 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 12917 states, 12916 states have (on average 4.42923505729328) internal successors, (57208), 12916 states have internal predecessors, (57208), 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) [2024-02-10 00:04:25,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12917 states, 12916 states have (on average 4.42923505729328) internal successors, (57208), 12916 states have internal predecessors, (57208), 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) [2024-02-10 00:04:26,288 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 12650 [2024-02-10 00:04:26,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:04:26,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:04:26,310 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:04:26,311 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:04:26,311 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 121 places, 127 transitions, 272 flow [2024-02-10 00:04:26,845 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 12917 states, 12916 states have (on average 4.42923505729328) internal successors, (57208), 12916 states have internal predecessors, (57208), 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) [2024-02-10 00:04:26,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12917 states, 12916 states have (on average 4.42923505729328) internal successors, (57208), 12916 states have internal predecessors, (57208), 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) [2024-02-10 00:04:27,799 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 12650 [2024-02-10 00:04:27,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:04:27,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:04:27,815 INFO L748 eck$LassoCheckResult]: Stem: Black: 25963#[$Ultimate##0]don't care [227] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 25966#[L-1]don't care [238] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_4|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|} AuxVars[] AssignedVars[] 25968#[L21]don't care [292] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_13| 1))) InVars {#length=|v_#length_13|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_13|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 25970#[L21-1]don't care [309] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_10| 1) 0)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 25972#[L21-2]don't care [253] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_11| 1) 1) 0) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 25974#[L21-3]don't care [285] L21-3-->L21-4: Formula: (and (= (select |v_#valid_21| 2) 1) (= 31 (select |v_#length_14| 2))) InVars {#length=|v_#length_14|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_14|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 25976#[L21-4]don't care [268] L21-4-->L39: Formula: (= v_~pos~0_14 0) InVars {} OutVars{~pos~0=v_~pos~0_14} AuxVars[] AssignedVars[~pos~0] 25978#[L39]don't care [310] L39-->L39-1: Formula: (= v_~d1~0_8 0) InVars {} OutVars{~d1~0=v_~d1~0_8} AuxVars[] AssignedVars[~d1~0] 25980#[L39-1]don't care [290] L39-1-->L39-2: Formula: (= v_~d2~0_8 0) InVars {} OutVars{~d2~0=v_~d2~0_8} AuxVars[] AssignedVars[~d2~0] 25982#[L39-2]don't care [324] L39-2-->L39-3: Formula: (= v_~d3~0_8 0) InVars {} OutVars{~d3~0=v_~d3~0_8} AuxVars[] AssignedVars[~d3~0] 25984#[L39-3]don't care [257] L39-3-->L39-4: Formula: (= v_~g1~0_4 0) InVars {} OutVars{~g1~0=v_~g1~0_4} AuxVars[] AssignedVars[~g1~0] 25986#[L39-4]don't care [213] L39-4-->L39-5: Formula: (= v_~g2~0_4 0) InVars {} OutVars{~g2~0=v_~g2~0_4} AuxVars[] AssignedVars[~g2~0] 25988#[L39-5]don't care [250] L39-5-->L-1-1: Formula: (= v_~g3~0_4 0) InVars {} OutVars{~g3~0=v_~g3~0_4} AuxVars[] AssignedVars[~g3~0] 25990#[L-1-1]don't care [321] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 25992#[L-1-2]don't care [325] L-1-2-->L108: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t2~0#1.base] 25994#[L108]don't care [214] L108-->L108-1: Formula: (and (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_1|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_1|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 25996#[L108-1]don't care [280] L108-1-->L108-2: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 25998#[L108-2]don't care [291] L108-2-->L108-3: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 26000#[L108-3]don't care [204] L108-3-->L112: Formula: (= v_~d1~0_7 1) InVars {} OutVars{~d1~0=v_~d1~0_7} AuxVars[] AssignedVars[~d1~0] 26002#[L112]don't care [258] L112-->L113: Formula: (= v_~d2~0_7 1) InVars {} OutVars{~d2~0=v_~d2~0_7} AuxVars[] AssignedVars[~d2~0] 26004#[L113]don't care [304] L113-->L114: Formula: (= v_~d3~0_7 1) InVars {} OutVars{~d3~0=v_~d3~0_7} AuxVars[] AssignedVars[~d3~0] 26006#[L114]don't care [259] L114-->L115: Formula: (= v_~g1~0_5 1) InVars {} OutVars{~g1~0=v_~g1~0_5} AuxVars[] AssignedVars[~g1~0] 26008#[L115]don't care [261] L115-->L116: Formula: (= v_~g2~0_5 1) InVars {} OutVars{~g2~0=v_~g2~0_5} AuxVars[] AssignedVars[~g2~0] 26010#[L116]don't care [226] L116-->L119: Formula: (= v_~g3~0_5 1) InVars {} OutVars{~g3~0=v_~g3~0_5} AuxVars[] AssignedVars[~g3~0] 26012#[L119]don't care [316] L119-->L119-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 26014#[L119-1]don't care [225] L119-1-->L119-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 26016#[L119-2]don't care [249] L119-2-->L119-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 26018#[L119-3]don't care [385] L119-3-->L53-1: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_12|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 26020#[L119-4, L53-1]don't care [2024-02-10 00:04:27,816 INFO L750 eck$LassoCheckResult]: Loop: 26020#[L119-4, L53-1]don't care [329] L53-1-->L43: Formula: (not (= (mod v_~g1~0_2 256) 0)) InVars {~g1~0=v_~g1~0_2} OutVars{~g1~0=v_~g1~0_2} AuxVars[] AssignedVars[] 26026#[L119-4, L43]don't care [333] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[] 26038#[L119-4, L48]don't care [336] L48-->L50: Formula: (= v_~pos~0_18 (+ v_~pos~0_17 1)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0] 26054#[L119-4, L50]don't care [338] L50-->L53: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0] 26072#[L119-4, L53]don't care [340] L53-->L53-1: Formula: (= (mod v_~d1~0_1 256) 0) InVars {~d1~0=v_~d1~0_1} OutVars{~d1~0=v_~d1~0_1} AuxVars[] AssignedVars[] 26020#[L119-4, L53-1]don't care [2024-02-10 00:04:27,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 135843091, now seen corresponding path program 1 times [2024-02-10 00:04:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:27,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776020073] [2024-02-10 00:04:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:27,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:28,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:28,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:28,105 INFO L85 PathProgramCache]: Analyzing trace with hash 342721677, now seen corresponding path program 1 times [2024-02-10 00:04:28,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:28,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563620509] [2024-02-10 00:04:28,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:28,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:04:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:04:28,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:04:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563620509] [2024-02-10 00:04:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563620509] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:04:28,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:04:28,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-10 00:04:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978662190] [2024-02-10 00:04:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:04:28,384 INFO L765 eck$LassoCheckResult]: loop already infeasible [2024-02-10 00:04:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:04:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:04:28,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:04:28,667 INFO L175 Difference]: Start difference. First operand has 121 places, 127 transitions, 272 flow. Second operand 4 states and 532 transitions. [2024-02-10 00:04:28,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 127 transitions, 272 flow. Second operand 4 states and 532 transitions. [2024-02-10 00:04:28,671 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 133 [2024-02-10 00:04:28,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:04:28,725 INFO L124 PetriNetUnfolderBase]: 10/131 cut-off events. [2024-02-10 00:04:28,725 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-10 00:04:28,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 131 events. 10/131 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 213 event pairs, 0 based on Foata normal form. 13/130 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2024-02-10 00:04:28,733 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 4 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2024-02-10 00:04:28,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 256 flow [2024-02-10 00:04:28,735 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 263 flow [2024-02-10 00:04:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-10 00:04:28,757 INFO L428 stractBuchiCegarLoop]: Abstraction has has 126 places, 111 transitions, 263 flow [2024-02-10 00:04:28,757 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:04:28,757 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:04:28,757 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 126 places, 111 transitions, 263 flow [2024-02-10 00:04:29,826 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 19662 states, 19658 states have (on average 4.062366466578492) internal successors, (79858), 19661 states have internal predecessors, (79858), 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) [2024-02-10 00:04:29,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19662 states, 19658 states have (on average 4.062366466578492) internal successors, (79858), 19661 states have internal predecessors, (79858), 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) [2024-02-10 00:04:30,800 INFO L131 ngComponentsAnalysis]: Automaton has 346 accepting balls. 19182 [2024-02-10 00:04:30,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:04:30,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:04:30,802 INFO L748 eck$LassoCheckResult]: Stem: Black: 51807#[$Ultimate##0]don't care [227] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 51810#[L-1]don't care [238] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_4|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|} AuxVars[] AssignedVars[] 51812#[L21]don't care [292] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_13| 1))) InVars {#length=|v_#length_13|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_13|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 51814#[L21-1]don't care [309] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_10| 1) 0)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 51816#[L21-2]don't care [253] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_11| 1) 1) 0) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 51818#[L21-3]don't care [285] L21-3-->L21-4: Formula: (and (= (select |v_#valid_21| 2) 1) (= 31 (select |v_#length_14| 2))) InVars {#length=|v_#length_14|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_14|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 51820#[L21-4]don't care [268] L21-4-->L39: Formula: (= v_~pos~0_14 0) InVars {} OutVars{~pos~0=v_~pos~0_14} AuxVars[] AssignedVars[~pos~0] 51822#[L39]don't care [310] L39-->L39-1: Formula: (= v_~d1~0_8 0) InVars {} OutVars{~d1~0=v_~d1~0_8} AuxVars[] AssignedVars[~d1~0] 51824#[L39-1]don't care [290] L39-1-->L39-2: Formula: (= v_~d2~0_8 0) InVars {} OutVars{~d2~0=v_~d2~0_8} AuxVars[] AssignedVars[~d2~0] 51826#[L39-2]don't care [324] L39-2-->L39-3: Formula: (= v_~d3~0_8 0) InVars {} OutVars{~d3~0=v_~d3~0_8} AuxVars[] AssignedVars[~d3~0] 51828#[L39-3]don't care [257] L39-3-->L39-4: Formula: (= v_~g1~0_4 0) InVars {} OutVars{~g1~0=v_~g1~0_4} AuxVars[] AssignedVars[~g1~0] 51830#[L39-4]don't care [213] L39-4-->L39-5: Formula: (= v_~g2~0_4 0) InVars {} OutVars{~g2~0=v_~g2~0_4} AuxVars[] AssignedVars[~g2~0] 51832#[L39-5]don't care [250] L39-5-->L-1-1: Formula: (= v_~g3~0_4 0) InVars {} OutVars{~g3~0=v_~g3~0_4} AuxVars[] AssignedVars[~g3~0] 51834#[L-1-1]don't care [321] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 51836#[L-1-2]don't care [325] L-1-2-->L108: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t2~0#1.base] 51838#[L108]don't care [214] L108-->L108-1: Formula: (and (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_1|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_1|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 51840#[L108-1]don't care [280] L108-1-->L108-2: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 51842#[L108-2]don't care [291] L108-2-->L108-3: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 51844#[L108-3]don't care [204] L108-3-->L112: Formula: (= v_~d1~0_7 1) InVars {} OutVars{~d1~0=v_~d1~0_7} AuxVars[] AssignedVars[~d1~0] 51846#[L112]don't care [258] L112-->L113: Formula: (= v_~d2~0_7 1) InVars {} OutVars{~d2~0=v_~d2~0_7} AuxVars[] AssignedVars[~d2~0] 51848#[L113]don't care [304] L113-->L114: Formula: (= v_~d3~0_7 1) InVars {} OutVars{~d3~0=v_~d3~0_7} AuxVars[] AssignedVars[~d3~0] 51850#[L114]don't care [259] L114-->L115: Formula: (= v_~g1~0_5 1) InVars {} OutVars{~g1~0=v_~g1~0_5} AuxVars[] AssignedVars[~g1~0] 51852#[L115]don't care [261] L115-->L116: Formula: (= v_~g2~0_5 1) InVars {} OutVars{~g2~0=v_~g2~0_5} AuxVars[] AssignedVars[~g2~0] 51854#[L116]don't care [226] L116-->L119: Formula: (= v_~g3~0_5 1) InVars {} OutVars{~g3~0=v_~g3~0_5} AuxVars[] AssignedVars[~g3~0] 51856#[L119]don't care [316] L119-->L119-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 51858#[L119-1]don't care [225] L119-1-->L119-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 51860#[L119-2]don't care [249] L119-2-->L119-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 51862#[L119-3]don't care [385] L119-3-->L53-1: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_12|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 51864#[L119-4, L53-1]don't care [2024-02-10 00:04:30,803 INFO L750 eck$LassoCheckResult]: Loop: 51864#[L119-4, L53-1]don't care [329] L53-1-->L43: Formula: (not (= (mod v_~g1~0_2 256) 0)) InVars {~g1~0=v_~g1~0_2} OutVars{~g1~0=v_~g1~0_2} AuxVars[] AssignedVars[] 51868#[L119-4, L43]don't care [332] L43-->L44: Formula: (not (= (mod v_~d1~0_2 256) 0)) InVars {~d1~0=v_~d1~0_2} OutVars{~d1~0=v_~d1~0_2} AuxVars[] AssignedVars[] 51878#[L119-4, L44]don't care [335] L44-->L50: Formula: (= v_~pos~0_23 (+ v_~pos~0_24 1)) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0] 51892#[L119-4, L50]don't care [338] L50-->L53: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0] 51910#[L119-4, L53]don't care [340] L53-->L53-1: Formula: (= (mod v_~d1~0_1 256) 0) InVars {~d1~0=v_~d1~0_1} OutVars{~d1~0=v_~d1~0_1} AuxVars[] AssignedVars[] 51928#[L119-4, L53-1]don't care [329] L53-1-->L43: Formula: (not (= (mod v_~g1~0_2 256) 0)) InVars {~g1~0=v_~g1~0_2} OutVars{~g1~0=v_~g1~0_2} AuxVars[] AssignedVars[] 51948#[L119-4, L43]don't care [333] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[] 51978#[L119-4, L48]don't care [336] L48-->L50: Formula: (= v_~pos~0_18 (+ v_~pos~0_17 1)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0] 52026#[L119-4, L50]don't care [338] L50-->L53: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0] 52102#[L119-4, L53]don't care [339] L53-->L54: Formula: (not (= (mod v_~d1~0_6 256) 0)) InVars {~d1~0=v_~d1~0_6} OutVars{~d1~0=v_~d1~0_6} AuxVars[] AssignedVars[] 52208#[L119-4, L54]don't care [341] L54-->L54-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3] 52346#[L119-4, L54-1]don't care [343] L54-1-->L54-4: Formula: (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_5| 256) 0) InVars {thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_5|} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_5|} AuxVars[] AssignedVars[] 52516#[L119-4, L54-4]don't care [345] L54-4-->L53-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3] 51864#[L119-4, L53-1]don't care [2024-02-10 00:04:30,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash 135843091, now seen corresponding path program 2 times [2024-02-10 00:04:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:30,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041323131] [2024-02-10 00:04:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:30,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:31,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:31,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:31,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1312336727, now seen corresponding path program 1 times [2024-02-10 00:04:31,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:31,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858538397] [2024-02-10 00:04:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:31,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:31,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:31,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1456657531, now seen corresponding path program 1 times [2024-02-10 00:04:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:31,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730514197] [2024-02-10 00:04:31,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:31,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:31,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:31,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:32,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:32,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:04:32 BoogieIcfgContainer [2024-02-10 00:04:32,591 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:04:32,613 INFO L158 Benchmark]: Toolchain (without parser) took 9181.01ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 100.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 265.8MB. Max. memory is 8.0GB. [2024-02-10 00:04:32,629 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 172.0MB. Free memory was 110.7MB in the beginning and 110.6MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:04:32,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.64ms. Allocated memory is still 172.0MB. Free memory was 99.8MB in the beginning and 143.0MB in the end (delta: -43.2MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2024-02-10 00:04:32,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.82ms. Allocated memory is still 172.0MB. Free memory was 143.0MB in the beginning and 141.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:04:32,637 INFO L158 Benchmark]: Boogie Preprocessor took 28.90ms. Allocated memory is still 172.0MB. Free memory was 141.4MB in the beginning and 139.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:04:32,640 INFO L158 Benchmark]: RCFGBuilder took 575.84ms. Allocated memory is still 172.0MB. Free memory was 139.8MB in the beginning and 123.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-02-10 00:04:32,642 INFO L158 Benchmark]: BuchiAutomizer took 8173.88ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 123.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 289.8MB. Max. memory is 8.0GB. [2024-02-10 00:04:32,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.78ms. Allocated memory is still 172.0MB. Free memory was 110.7MB in the beginning and 110.6MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 365.64ms. Allocated memory is still 172.0MB. Free memory was 99.8MB in the beginning and 143.0MB in the end (delta: -43.2MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.82ms. Allocated memory is still 172.0MB. Free memory was 143.0MB in the beginning and 141.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.90ms. Allocated memory is still 172.0MB. Free memory was 141.4MB in the beginning and 139.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 575.84ms. Allocated memory is still 172.0MB. Free memory was 139.8MB in the beginning and 123.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 8173.88ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 123.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 289.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 263 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 802 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 452 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 350 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 42]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L38] 0 int pos; VAL [pos=0] [L39] 0 _Bool d1, d2, d3, g1, g2, g3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L108] 0 pthread_t t1, t2, t3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L111] 0 d1 = 1 VAL [d1=1, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L112] 0 d2 = 1 VAL [d1=1, d2=1, d3=0, g1=0, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L113] 0 d3 = 1 VAL [d1=1, d2=1, d3=1, g1=0, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L114] 0 g1 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L115] 0 g2 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L116] 0 g3 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L119] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0, pthread_create(&t1, 0, thread1, 0)=5020, t1={19145:0}, t2={19144:0}, t3={19143:0}] Loop: [L42] COND TRUE \read(g1) [L43] COND TRUE \read(d1) [L45] pos++ [L52] d1 = !d1 [L53] COND FALSE !(\read(d1)) [L42] COND TRUE \read(g1) [L43] COND FALSE !(\read(d1)) [L49] pos-- [L52] d1 = !d1 [L53] COND TRUE \read(d1) [L54] COND FALSE !(__VERIFIER_nondet_bool()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L38] 0 int pos; VAL [pos=0] [L39] 0 _Bool d1, d2, d3, g1, g2, g3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L108] 0 pthread_t t1, t2, t3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L111] 0 d1 = 1 VAL [d1=1, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L112] 0 d2 = 1 VAL [d1=1, d2=1, d3=0, g1=0, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L113] 0 d3 = 1 VAL [d1=1, d2=1, d3=1, g1=0, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L114] 0 g1 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=0, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L115] 0 g2 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=0, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L116] 0 g3 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0, t1={19145:0}, t2={19144:0}, t3={19143:0}] [L119] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0, pthread_create(&t1, 0, thread1, 0)=5020, t1={19145:0}, t2={19144:0}, t3={19143:0}] Loop: [L42] COND TRUE \read(g1) [L43] COND TRUE \read(d1) [L45] pos++ [L52] d1 = !d1 [L53] COND FALSE !(\read(d1)) [L42] COND TRUE \read(g1) [L43] COND FALSE !(\read(d1)) [L49] pos-- [L52] d1 = !d1 [L53] COND TRUE \read(d1) [L54] COND FALSE !(__VERIFIER_nondet_bool()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 00:04:32,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...