/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 false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:07:21,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:07:21,894 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 01:07:21,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:07:21,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:07:21,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:07:21,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:07:21,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:07:21,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:07:21,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:07:21,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:07:21,970 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:07:21,970 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:07:21,971 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:07:21,972 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:07:21,972 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:07:21,972 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:07:21,972 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:07:21,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:07:21,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:07:21,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:07:21,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:07:21,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:07:21,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:07:21,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:07:21,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:07:21,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:07:21,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:07:21,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:07:21,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:07:21,977 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:07:21,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:07:21,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:07:21,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:07:21,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:07:21,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:07:21,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:07:21,979 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:07:21,979 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 -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:07:22,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:07:22,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:07:22,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:07:22,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 01:07:22,592 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 01:07:22,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-02-10 01:07:24,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 01:07:25,279 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 01:07:25,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-02-10 01:07:25,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2527108/cd9806d86697437597d0d5ac119e9f31/FLAGa84b331e9 [2024-02-10 01:07:25,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2527108/cd9806d86697437597d0d5ac119e9f31 [2024-02-10 01:07:25,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:07:25,363 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 01:07:25,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 01:07:25,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 01:07:25,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 01:07:25,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:25,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1633b2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25, skipping insertion in model container [2024-02-10 01:07:25,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:25,415 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 01:07:25,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 01:07:25,849 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 01:07:25,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 01:07:25,934 INFO L206 MainTranslator]: Completed translation [2024-02-10 01:07:25,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25 WrapperNode [2024-02-10 01:07:25,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 01:07:25,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:07:25,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:07:25,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:07:25,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:25,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,009 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-02-10 01:07:26,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:07:26,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:07:26,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:07:26,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:07:26,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:07:26,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:07:26,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:07:26,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:07:26,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (1/1) ... [2024-02-10 01:07:26,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:07:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:07:26,124 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 01:07:26,158 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 01:07:26,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 01:07:26,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 01:07:26,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 01:07:26,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 01:07:26,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 01:07:26,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 01:07:26,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 01:07:26,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 01:07:26,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 01:07:26,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 01:07:26,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-10 01:07:26,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-10 01:07:26,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 01:07:26,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-02-10 01:07:26,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-02-10 01:07:26,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-02-10 01:07:26,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-02-10 01:07:26,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:07:26,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:07:26,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 01:07:26,192 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 01:07:26,327 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:07:26,330 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:07:26,966 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:07:26,974 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:07:26,974 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2024-02-10 01:07:27,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:07:27 BoogieIcfgContainer [2024-02-10 01:07:27,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:07:27,013 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:07:27,013 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:07:27,017 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:07:27,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:07:27,017 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 01:07:25" (1/3) ... [2024-02-10 01:07:27,018 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42f13331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:07:27, skipping insertion in model container [2024-02-10 01:07:27,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:07:27,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:07:25" (2/3) ... [2024-02-10 01:07:27,019 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42f13331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:07:27, skipping insertion in model container [2024-02-10 01:07:27,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:07:27,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:07:27" (3/3) ... [2024-02-10 01:07:27,046 INFO L332 chiAutomizerObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-02-10 01:07:27,325 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-02-10 01:07:27,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 180 transitions, 402 flow [2024-02-10 01:07:27,548 INFO L124 PetriNetUnfolderBase]: 14/168 cut-off events. [2024-02-10 01:07:27,549 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-10 01:07:27,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 168 events. 14/168 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 123. Up to 2 conditions per place. [2024-02-10 01:07:27,558 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 180 transitions, 402 flow [2024-02-10 01:07:27,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 168 transitions, 372 flow [2024-02-10 01:07:27,599 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:07:27,600 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:07:27,600 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:07:27,600 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:07:27,600 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:07:27,600 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:07:27,604 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:07:27,604 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:07:27,604 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:07:27,605 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 173 places, 168 transitions, 372 flow [2024-02-10 01:07:36,400 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 97727 states, 97726 states have (on average 7.4954259869430855) internal successors, (732498), 97726 states have internal predecessors, (732498), 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 01:07:36,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 97727 states, 97726 states have (on average 7.4954259869430855) internal successors, (732498), 97726 states have internal predecessors, (732498), 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 01:07:45,253 INFO L131 ngComponentsAnalysis]: Automaton has 22477 accepting balls. 91462 [2024-02-10 01:07:45,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:07:45,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:07:45,274 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:07:45,275 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:07:45,275 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 173 places, 168 transitions, 372 flow [2024-02-10 01:07:52,928 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 97727 states, 97726 states have (on average 7.4954259869430855) internal successors, (732498), 97726 states have internal predecessors, (732498), 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 01:07:53,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 97727 states, 97726 states have (on average 7.4954259869430855) internal successors, (732498), 97726 states have internal predecessors, (732498), 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 01:08:00,399 INFO L131 ngComponentsAnalysis]: Automaton has 22477 accepting balls. 91462 [2024-02-10 01:08:00,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:08:00,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:08:00,436 INFO L748 eck$LassoCheckResult]: Stem: Black: 195638#[$Ultimate##0]don't care [259] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 195641#[L-1]don't care [270] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 195643#[L21]don't care [338] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 195645#[L21-1]don't care [367] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 195647#[L21-2]don't care [284] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 195649#[L21-3]don't care [326] L21-3-->L21-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 195651#[L21-4]don't care [303] L21-4-->L38: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 195653#[L38]don't care [304] L38-->L38-1: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] 195655#[L38-1]don't care [328] L38-1-->L38-2: Formula: (= v_~x3~0_5 0) InVars {} OutVars{~x3~0=v_~x3~0_5} AuxVars[] AssignedVars[~x3~0] 195657#[L38-2]don't care [379] L38-2-->L38-3: Formula: (= v_~x4~0_5 0) InVars {} OutVars{~x4~0=v_~x4~0_5} AuxVars[] AssignedVars[~x4~0] 195659#[L38-3]don't care [268] L38-3-->L38-4: Formula: (= v_~x5~0_5 0) InVars {} OutVars{~x5~0=v_~x5~0_5} AuxVars[] AssignedVars[~x5~0] 195661#[L38-4]don't care [313] L38-4-->L38-5: Formula: (= v_~x6~0_5 0) InVars {} OutVars{~x6~0=v_~x6~0_5} AuxVars[] AssignedVars[~x6~0] 195663#[L38-5]don't care [227] L38-5-->L-1-1: Formula: (= v_~n~0_13 0) InVars {} OutVars{~n~0=v_~n~0_13} AuxVars[] AssignedVars[~n~0] 195665#[L-1-1]don't care [384] 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] 195667#[L-1-2]don't care [387] L-1-2-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#t6~0#1.base=|v_ULTIMATE.start_main_~#t6~0#1.base_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_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_~#t5~0#1.base=|v_ULTIMATE.start_main_~#t5~0#1.base_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#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_~#t5~0#1.offset=|v_ULTIMATE.start_main_~#t5~0#1.offset_1|, ULTIMATE.start_main_~#t6~0#1.offset=|v_ULTIMATE.start_main_~#t6~0#1.offset_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#t6~0#1.base, 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_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet1#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem23#1, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_~#t5~0#1.base, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t5~0#1.offset, ULTIMATE.start_main_~#t6~0#1.offset, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~mem24#1] 195669#[L89]don't care [312] L89-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, 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_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 195671#[L89-1]don't care [286] L89-1-->L89-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 195673#[L89-2]don't care [322] L89-2-->L89-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 195675#[L89-3]don't care [301] L89-3-->L89-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 195677#[L89-4]don't care [362] L89-4-->L89-5: Formula: (and (< |v_#StackHeapBarrier_6| |v_ULTIMATE.start_main_~#t5~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t5~0#1.offset_2| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t5~0#1.base_2| 4) |v_#length_11|) (= |v_#valid_12| (store |v_#valid_13| |v_ULTIMATE.start_main_~#t5~0#1.base_2| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t5~0#1.base_2|)) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t5~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_12|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~#t5~0#1.offset=|v_ULTIMATE.start_main_~#t5~0#1.offset_2|, ULTIMATE.start_main_~#t5~0#1.base=|v_ULTIMATE.start_main_~#t5~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_11|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t5~0#1.base, #valid, ULTIMATE.start_main_~#t5~0#1.offset, #length] 195679#[L89-5]don't care [378] L89-5-->L89-6: Formula: (and (= |v_ULTIMATE.start_main_~#t6~0#1.offset_2| 0) (= |v_#valid_14| (store |v_#valid_15| |v_ULTIMATE.start_main_~#t6~0#1.base_2| 1)) (= (select |v_#valid_15| |v_ULTIMATE.start_main_~#t6~0#1.base_2|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t6~0#1.base_2| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t6~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#t6~0#1.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #length=|v_#length_14|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~#t6~0#1.offset=|v_ULTIMATE.start_main_~#t6~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t6~0#1.base=|v_ULTIMATE.start_main_~#t6~0#1.base_2|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t6~0#1.base, #valid, ULTIMATE.start_main_~#t6~0#1.offset, #length] 195681#[L89-6]don't care [234] L89-6-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1#1] 195683#[L92]don't care [356] L92-->L92-1: Formula: (= v_~x1~0_6 |v_ULTIMATE.start_main_#t~nondet1#1_3|) InVars {ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_3|} OutVars{~x1~0=v_~x1~0_6, ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_3|} AuxVars[] AssignedVars[~x1~0] 195685#[L92-1]don't care [350] L92-1-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1#1] 195687#[L93]don't care [267] L93-->L93-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] 195689#[L93-1]don't care [358] L93-1-->L93-2: Formula: (= v_~x2~0_6 |v_ULTIMATE.start_main_#t~nondet2#1_3|) InVars {ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_3|} OutVars{~x2~0=v_~x2~0_6, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_3|} AuxVars[] AssignedVars[~x2~0] 195691#[L93-2]don't care [340] L93-2-->L94: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] 195693#[L94]don't care [371] L94-->L94-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 195695#[L94-1]don't care [318] L94-1-->L94-2: Formula: (= v_~x3~0_6 |v_ULTIMATE.start_main_#t~nondet3#1_3|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{~x3~0=v_~x3~0_6, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} AuxVars[] AssignedVars[~x3~0] 195697#[L94-2]don't care [352] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 195699#[L95]don't care [330] L95-->L95-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] 195701#[L95-1]don't care [343] L95-1-->L95-2: Formula: (= v_~x4~0_6 |v_ULTIMATE.start_main_#t~nondet4#1_3|) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|, ~x4~0=v_~x4~0_6} AuxVars[] AssignedVars[~x4~0] 195703#[L95-2]don't care [344] L95-2-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] 195705#[L96]don't care [357] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 195707#[L96-1]don't care [310] L96-1-->L96-2: Formula: (= v_~x5~0_6 |v_ULTIMATE.start_main_#t~nondet5#1_3|) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~x5~0=v_~x5~0_6} AuxVars[] AssignedVars[~x5~0] 195709#[L96-2]don't care [252] L96-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 195711#[L97]don't care [317] L97-->L97-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 195713#[L97-1]don't care [324] L97-1-->L97-2: Formula: (= v_~x6~0_6 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|, ~x6~0=v_~x6~0_6} AuxVars[] AssignedVars[~x6~0] 195715#[L97-2]don't care [377] L97-2-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 195717#[L98]don't care [349] L98-->L98-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 195719#[L98-1]don't care [240] L98-1-->L98-2: Formula: (= v_~n~0_14 |v_ULTIMATE.start_main_#t~nondet7#1_3|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~n~0=v_~n~0_14, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~n~0] 195721#[L98-2]don't care [319] L98-2-->L101: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 195723#[L101]don't care [374] L101-->L101-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= (mod v_~x4~0_7 4294967296) (mod v_~x3~0_7 4294967296)) (= (mod v_~x2~0_7 4294967296) (mod v_~x1~0_7 4294967296)) (= (mod v_~x5~0_7 4294967296) (mod v_~x6~0_7 4294967296))) 1 0)) InVars {~x3~0=v_~x3~0_7, ~x2~0=v_~x2~0_7, ~x4~0=v_~x4~0_7, ~x5~0=v_~x5~0_7, ~x6~0=v_~x6~0_7, ~x1~0=v_~x1~0_7} OutVars{~x3~0=v_~x3~0_7, ~x2~0=v_~x2~0_7, ~x4~0=v_~x4~0_7, ~x5~0=v_~x5~0_7, ~x6~0=v_~x6~0_7, ~x1~0=v_~x1~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 195725#[L101-1]don't care [249] L101-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 195727#[L34]don't care [256] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 195729#[L35]don't care [369] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 195733#[L34-1]don't care [363] L34-1-->L101-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 195735#[L101-2]don't care [325] L101-2-->L103: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 195737#[L103]don't care [372] L103-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] 195739#[L103-1]don't care [281] L103-1-->L103-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 195741#[L103-2]don't care [337] L103-2-->L103-3: Formula: (and (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_15| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre8#1_3|)) |v_#memory_int_3|)) InVars {#valid=|v_#valid_16|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, #length=|v_#length_15|, 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{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, #length=|v_#length_15|, 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] 195743#[L103-3]don't care [448] L103-3-->L41-1: Formula: (and (= v_thread1Thread1of1ForFork5_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre8#1_7| v_thread1Thread1of1ForFork5_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|} OutVars{thread1Thread1of1ForFork5_thidvar1=v_thread1Thread1of1ForFork5_thidvar1_2, thread1Thread1of1ForFork5_#res.offset=|v_thread1Thread1of1ForFork5_#res.offset_4|, thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|, thread1Thread1of1ForFork5_#res.base=|v_thread1Thread1of1ForFork5_#res.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar1, thread1Thread1of1ForFork5_#res.offset, thread1Thread1of1ForFork5_thidvar0, thread1Thread1of1ForFork5_#res.base] 195745#[L41-1, L103-4]don't care [2024-02-10 01:08:00,439 INFO L750 eck$LassoCheckResult]: Loop: 195745#[L41-1, L103-4]don't care [395] L41-1-->L42: Formula: (< (mod v_~x1~0_2 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, ~x1~0=v_~x1~0_2} OutVars{~n~0=v_~n~0_2, ~x1~0=v_~x1~0_2} AuxVars[] AssignedVars[] 195747#[L103-4, L42]don't care [398] L42-->L41-1: Formula: (= v_~x1~0_3 (* v_~x1~0_4 2)) InVars {~x1~0=v_~x1~0_4} OutVars{~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 195745#[L41-1, L103-4]don't care [2024-02-10 01:08:00,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:08:00,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1065332137, now seen corresponding path program 1 times [2024-02-10 01:08:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:08:00,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877537391] [2024-02-10 01:08:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:08:00,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:08:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:08:00,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:08:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:08:00,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:08:00,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:08:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash 13604, now seen corresponding path program 1 times [2024-02-10 01:08:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:08:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22676033] [2024-02-10 01:08:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:08:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:08:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:08:01,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:08:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:08:01,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:08:01,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:08:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1581979852, now seen corresponding path program 1 times [2024-02-10 01:08:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:08:01,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097469686] [2024-02-10 01:08:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:08:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:08:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:08:01,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:08:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:08:01,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:08:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:08:07,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:08:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:08:07,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:08:07 BoogieIcfgContainer [2024-02-10 01:08:07,556 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:08:07,558 INFO L158 Benchmark]: Toolchain (without parser) took 42194.43ms. Allocated memory was 239.1MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 211.6MB in the beginning and 6.4GB in the end (delta: -6.2GB). Peak memory consumption was 979.1MB. Max. memory is 8.0GB. [2024-02-10 01:08:07,558 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 175.1MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:08:07,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.67ms. Allocated memory is still 239.1MB. Free memory was 211.6MB in the beginning and 199.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 01:08:07,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.95ms. Allocated memory is still 239.1MB. Free memory was 199.5MB in the beginning and 197.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:08:07,560 INFO L158 Benchmark]: Boogie Preprocessor took 41.60ms. Allocated memory is still 239.1MB. Free memory was 197.4MB in the beginning and 195.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:08:07,560 INFO L158 Benchmark]: RCFGBuilder took 955.24ms. Allocated memory is still 239.1MB. Free memory was 195.8MB in the beginning and 177.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-02-10 01:08:07,561 INFO L158 Benchmark]: BuchiAutomizer took 40543.27ms. Allocated memory was 239.1MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 177.0MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 944.5MB. Max. memory is 8.0GB. [2024-02-10 01:08:07,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 175.1MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 574.67ms. Allocated memory is still 239.1MB. Free memory was 211.6MB in the beginning and 199.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.95ms. Allocated memory is still 239.1MB. Free memory was 199.5MB in the beginning and 197.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.60ms. Allocated memory is still 239.1MB. Free memory was 197.4MB in the beginning and 195.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 955.24ms. Allocated memory is still 239.1MB. Free memory was 195.8MB in the beginning and 177.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 40543.27ms. Allocated memory was 239.1MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 177.0MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 944.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.0s and 1 iterations. TraceHistogramMax:0. Analysis of lassos took 6.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. 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: LassoAnalysisResults: nont1 unkn0 SFLI0 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.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L38] 0 unsigned int x1, x2, x3, x4, x5, x6, n; VAL [n=0, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L89] 0 pthread_t t1, t2, t3, t4, t5, t6; VAL [n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L92] 0 x1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L93] 0 x2 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L94] 0 x3 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L95] 0 x4 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L96] 0 x5 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L97] 0 x6 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L98] 0 n = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=1, n=1, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L101] CALL 0 assume_abort_if_not( x1 == x2 && x3 == x4 && x5 == x6 ) [L35] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=1, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L101] RET 0 assume_abort_if_not( x1 == x2 && x3 == x4 && x5 == x6 ) [L103] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [n=1, pthread_create(&t1, 0, thread1, 0)=3583, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] Loop: [L41] COND TRUE x1 < n [L42] x1 = x1 + x1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L38] 0 unsigned int x1, x2, x3, x4, x5, x6, n; VAL [n=0, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L89] 0 pthread_t t1, t2, t3, t4, t5, t6; VAL [n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L92] 0 x1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L93] 0 x2 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L94] 0 x3 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L95] 0 x4 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L96] 0 x5 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L97] 0 x6 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, n=0, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L98] 0 n = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=1, n=1, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L101] CALL 0 assume_abort_if_not( x1 == x2 && x3 == x4 && x5 == x6 ) [L35] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=1, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] [L101] RET 0 assume_abort_if_not( x1 == x2 && x3 == x4 && x5 == x6 ) [L103] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [n=1, pthread_create(&t1, 0, thread1, 0)=3583, t1={24942:0}, t2={24947:0}, t3={24944:0}, t4={24945:0}, t5={24946:0}, t6={24943:0}, x1=0, x2=0, x3=0, x4=0, x5=0, x6=0] Loop: [L41] COND TRUE x1 < n [L42] x1 = x1 + x1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 01:08:07,780 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...