/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_AUTOMATON -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:12:35,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:12:35,406 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-09 23:12:35,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:12:35,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:12:35,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:12:35,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:12:35,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:12:35,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:12:35,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:12:35,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:12:35,486 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:12:35,486 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:12:35,487 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:12:35,487 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:12:35,488 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:12:35,488 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:12:35,488 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:12:35,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:12:35,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:12:35,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:12:35,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:12:35,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:12:35,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:12:35,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:12:35,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:12:35,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:12:35,491 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:12:35,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:12:35,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:12:35,492 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:12:35,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:12:35,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:12:35,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:12:35,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:12:35,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:12:35,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:12:35,494 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:12:35,494 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_AUTOMATON [2024-02-09 23:12:35,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:12:35,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:12:35,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:12:35,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-09 23:12:35,840 INFO L274 PluginConnector]: CDTParser initialized [2024-02-09 23:12:35,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2024-02-09 23:12:37,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-09 23:12:37,367 INFO L384 CDTParser]: Found 1 translation units. [2024-02-09 23:12:37,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-02-09 23:12:37,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34690c16a/e8a17dc3a881400388b0f51c761494ac/FLAG112259c91 [2024-02-09 23:12:37,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34690c16a/e8a17dc3a881400388b0f51c761494ac [2024-02-09 23:12:37,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:12:37,403 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-09 23:12:37,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-09 23:12:37,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-09 23:12:37,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-09 23:12:37,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c24ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37, skipping insertion in model container [2024-02-09 23:12:37,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,481 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-09 23:12:37,660 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-09 23:12:37,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:12:37,781 INFO L202 MainTranslator]: Completed pre-run [2024-02-09 23:12:37,810 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-09 23:12:37,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:12:37,875 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:12:37,875 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:12:37,875 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:12:37,882 INFO L206 MainTranslator]: Completed translation [2024-02-09 23:12:37,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37 WrapperNode [2024-02-09 23:12:37,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-09 23:12:37,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:12:37,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:12:37,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:12:37,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,949 INFO L138 Inliner]: procedures = 172, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-02-09 23:12:37,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:12:37,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:12:37,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:12:37,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:12:37,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:37,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:12:37,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:12:37,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:12:37,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:12:38,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (1/1) ... [2024-02-09 23:12:38,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:12:38,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:12:38,041 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-09 23:12:38,062 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-09 23:12:38,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-09 23:12:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-02-09 23:12:38,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-02-09 23:12:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-09 23:12:38,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-09 23:12:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-09 23:12:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-09 23:12:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-09 23:12:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-09 23:12:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-09 23:12:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-09 23:12:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-09 23:12:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:12:38,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:12:38,094 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:12:38,247 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:12:38,249 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:12:38,424 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:12:38,430 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:12:38,431 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-09 23:12:38,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:12:38 BoogieIcfgContainer [2024-02-09 23:12:38,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:12:38,434 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:12:38,435 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:12:38,438 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:12:38,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:12:38,439 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.02 11:12:37" (1/3) ... [2024-02-09 23:12:38,440 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@200e09be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:12:38, skipping insertion in model container [2024-02-09 23:12:38,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:12:38,440 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:12:37" (2/3) ... [2024-02-09 23:12:38,440 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@200e09be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:12:38, skipping insertion in model container [2024-02-09 23:12:38,440 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:12:38,440 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:12:38" (3/3) ... [2024-02-09 23:12:38,442 INFO L332 chiAutomizerObserver]: Analyzing ICFG dekker.i [2024-02-09 23:12:38,530 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:12:38,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 114 transitions, 242 flow [2024-02-09 23:12:38,598 INFO L124 PetriNetUnfolderBase]: 15/110 cut-off events. [2024-02-09 23:12:38,599 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:12:38,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 110 events. 15/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 203 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2024-02-09 23:12:38,606 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 114 transitions, 242 flow [2024-02-09 23:12:38,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 110 transitions, 232 flow [2024-02-09 23:12:38,631 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:12:38,631 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:12:38,632 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:12:38,632 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:12:38,632 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:12:38,632 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:12:38,632 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:12:38,632 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:12:38,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:12:38,916 INFO L131 ngComponentsAnalysis]: Automaton has 133 accepting balls. 1690 [2024-02-09 23:12:38,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:12:38,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:12:38,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:12:38,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-02-09 23:12:38,923 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:12:38,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2759 states, but on-demand construction may add more states [2024-02-09 23:12:38,965 INFO L131 ngComponentsAnalysis]: Automaton has 133 accepting balls. 1690 [2024-02-09 23:12:38,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:12:38,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:12:38,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:12:38,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-02-09 23:12:38,973 INFO L748 eck$LassoCheckResult]: Stem: 107#[$Ultimate##0]don't care [197] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 110#[L-1]don't care [211] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_3|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|} AuxVars[] AssignedVars[] 112#[L16]don't care [262] L16-->L16-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 114#[L16-1]don't care [179] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 116#[L16-2]don't care [283] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_1| 1) 1) 0) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 118#[L16-3]don't care [272] L16-3-->L16-4: Formula: (and (= (select |v_#valid_1| 2) 1) (= (select |v_#length_1| 2) 9)) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 120#[L16-4]don't care [222] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 122#[L704]don't care [227] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 124#[L705]don't care [265] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 126#[L706]don't care [270] L706-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 128#[L-1-1]don't care [278] 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] 130#[L-1-2]don't care [279] L-1-2-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 132#[L790]don't care [241] L790-->L790-1: Formula: (and (= (store |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_2|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, 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_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 134#[L790-1]don't care [267] L790-1-->L790-2: Formula: (and (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 136#[L790-2]don't care [254] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, 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] 138#[L791]don't care [200] L791-->L2: 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] 140#[L2]don't care [239] L2-->L3: 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] 142#[L3]don't care [230] L3-->L2-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[] 146#[L2-1]don't care [199] L2-1-->L791-1: 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] 148#[L791-1]don't care [196] L791-1-->L792: 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] 150#[L792]don't care [185] L792-->L792-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 152#[L792-1]don't care [232] L792-1-->L792-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 154#[L792-2]don't care [198] L792-2-->L792-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= |v_#memory_int_2| (store |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)))) InVars {#valid=|v_#valid_6|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 156#[L792-3]don't care [355] L792-3-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_10|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_18|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_~f2~0#1, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~t~0#1, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base] 158#[L792-4, $Ultimate##0]don't care [319] $Ultimate##0-->L708: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base] 162#[L792-4, L708]don't care [320] L708-->L710: Formula: (= v_~flag1~0_6 1) InVars {} OutVars{~flag1~0=v_~flag1~0_6} AuxVars[] AssignedVars[~flag1~0] 168#[L710, L792-4]don't care [321] L710-->L714-1: Formula: (= v_~flag2~0_5 |v_thr1Thread1of1ForFork1_~f2~0#1_1|) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_1|, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0#1] 176#[L792-4, L714-1]don't care [2024-02-09 23:12:38,974 INFO L750 eck$LassoCheckResult]: Loop: 176#[L792-4, L714-1]don't care [322] L714-1-->L715: Formula: (<= 1 |v_thr1Thread1of1ForFork1_~f2~0#1_3|) InVars {thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_3|} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_3|} AuxVars[] AssignedVars[] 186#[L792-4, L715]don't care [325] L715-->L717: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_1| v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0#1] 202#[L792-4, L717]don't care [328] L717-->L718: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_5| 0) InVars {thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_5|} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_5|} AuxVars[] AssignedVars[] 224#[L792-4, L718]don't care [332] L718-->L736: Formula: (= v_~flag2~0_6 |v_thr1Thread1of1ForFork1_~f2~0#1_7|) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_7|, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0#1] 258#[L792-4, L736]don't care [336] L736-->L714-1: Formula: true InVars {} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_9|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0#1] 176#[L792-4, L714-1]don't care [2024-02-09 23:12:38,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash -467204160, now seen corresponding path program 1 times [2024-02-09 23:12:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:38,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322478152] [2024-02-09 23:12:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:39,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:12:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:39,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:12:39,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:39,210 INFO L85 PathProgramCache]: Analyzing trace with hash 336010824, now seen corresponding path program 1 times [2024-02-09 23:12:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:39,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231666396] [2024-02-09 23:12:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:39,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:39,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:12:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:39,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:12:39,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash -400943639, now seen corresponding path program 1 times [2024-02-09 23:12:39,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:39,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18533936] [2024-02-09 23:12:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:12:39,558 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-09 23:12:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:12:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18533936] [2024-02-09 23:12:39,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18533936] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:12:39,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:12:39,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:12:39,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410907727] [2024-02-09 23:12:39,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:12:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:12:39,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-09 23:12:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-09 23:12:39,684 INFO L87 Difference]: Start difference. First operand currently 2759 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-09 23:12:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:12:39,820 INFO L93 Difference]: Finished difference Result 3309 states and 9221 transitions. [2024-02-09 23:12:39,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3309 states and 9221 transitions. [2024-02-09 23:12:39,857 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 1804 [2024-02-09 23:12:39,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3309 states to 2288 states and 6511 transitions. [2024-02-09 23:12:39,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2288 [2024-02-09 23:12:39,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2288 [2024-02-09 23:12:39,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2288 states and 6511 transitions. [2024-02-09 23:12:39,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-02-09 23:12:39,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2288 states and 6511 transitions. [2024-02-09 23:12:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states and 6511 transitions. [2024-02-09 23:12:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 1815. [2024-02-09 23:12:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1815 states have (on average 2.8611570247933886) internal successors, (5193), 1814 states have internal predecessors, (5193), 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-09 23:12:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 5193 transitions. [2024-02-09 23:12:40,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1815 states and 5193 transitions. [2024-02-09 23:12:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-09 23:12:40,044 INFO L428 stractBuchiCegarLoop]: Abstraction has 1815 states and 5193 transitions. [2024-02-09 23:12:40,045 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:12:40,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1815 states and 5193 transitions. [2024-02-09 23:12:40,058 INFO L131 ngComponentsAnalysis]: Automaton has 111 accepting balls. 1374 [2024-02-09 23:12:40,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:12:40,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:12:40,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:12:40,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-02-09 23:12:40,062 INFO L748 eck$LassoCheckResult]: Stem: 9874#[$Ultimate##0]don't care [197] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 9876#[L-1]don't care [211] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_3|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|} AuxVars[] AssignedVars[] 12480#[L16]don't care [262] L16-->L16-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 11864#[L16-1]don't care [179] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 11866#[L16-2]don't care [283] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_1| 1) 1) 0) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 11804#[L16-3]don't care [272] L16-3-->L16-4: Formula: (and (= (select |v_#valid_1| 2) 1) (= (select |v_#length_1| 2) 9)) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 11806#[L16-4]don't care [222] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 11024#[L704]don't care [227] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 11026#[L705]don't care [265] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 12398#[L706]don't care [270] L706-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 11200#[L-1-1]don't care [278] 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] 11202#[L-1-2]don't care [279] L-1-2-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 9392#[L790]don't care [241] L790-->L790-1: Formula: (and (= (store |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_2|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, 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_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 9394#[L790-1]don't care [267] L790-1-->L790-2: Formula: (and (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 11470#[L790-2]don't care [254] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, 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] 10438#[L791]don't care [200] L791-->L2: 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] 10440#[L2]don't care [239] L2-->L3: 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] 11700#[L3]don't care [230] L3-->L2-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[] 9136#[L2-1]don't care [199] L2-1-->L791-1: 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] 9124#[L791-1]don't care [196] L791-1-->L792: 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] 9126#[L792]don't care [185] L792-->L792-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 12114#[L792-1]don't care [232] L792-1-->L792-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 12304#[L792-2]don't care [198] L792-2-->L792-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= |v_#memory_int_2| (store |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)))) InVars {#valid=|v_#valid_6|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 11970#[L792-3]don't care [355] L792-3-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_10|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_18|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_~f2~0#1, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~t~0#1, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base] 11972#[L792-4, $Ultimate##0]don't care [216] L792-4-->L792-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 10046#[$Ultimate##0, L792-5]don't care [181] L792-5-->L793: 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] 10048#[$Ultimate##0, L793]don't care [212] L793-->L793-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 12440#[L793-1, $Ultimate##0]don't care [194] L793-1-->L793-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 12442#[$Ultimate##0, L793-2]don't care [240] L793-2-->L793-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_4|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_5|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 10306#[L793-3, $Ultimate##0]don't care [352] L793-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork0_thidvar0_2) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_18|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_10|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~t~1#1, thr2Thread1of1ForFork0_#in~_#1.offset, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_~f1~0#1, thr2Thread1of1ForFork0_#res#1.base] 9922#[$Ultimate##0, L793-4, $Ultimate##0]don't care [288] $Ultimate##0-->L749: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset] 9924#[$Ultimate##0, L793-4, L749]don't care [289] L749-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 11796#[$Ultimate##0, L793-4, L751]don't care [290] L751-->L755-1: Formula: (= v_~flag1~0_1 |v_thr2Thread1of1ForFork0_~f1~0#1_1|) InVars {~flag1~0=v_~flag1~0_1} OutVars{thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_1|, ~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~f1~0#1] 11948#[$Ultimate##0, L793-4, L755-1]don't care [2024-02-09 23:12:40,062 INFO L750 eck$LassoCheckResult]: Loop: 11948#[$Ultimate##0, L793-4, L755-1]don't care [291] L755-1-->L756: Formula: (<= 1 |v_thr2Thread1of1ForFork0_~f1~0#1_3|) InVars {thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_3|} OutVars{thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_3|} AuxVars[] AssignedVars[] 11440#[$Ultimate##0, L793-4, L756]don't care [294] L756-->L758: Formula: (= |v_thr2Thread1of1ForFork0_~t~1#1_1| v_~turn~0_1) InVars {~turn~0=v_~turn~0_1} OutVars{~turn~0=v_~turn~0_1, thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~t~1#1] 11442#[$Ultimate##0, L793-4, L758]don't care [297] L758-->L759: Formula: (= |v_thr2Thread1of1ForFork0_~t~1#1_5| 1) InVars {thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_5|} OutVars{thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_5|} AuxVars[] AssignedVars[] 12246#[$Ultimate##0, L793-4, L759]don't care [301] L759-->L777: Formula: (= v_~flag1~0_2 |v_thr2Thread1of1ForFork0_~f1~0#1_7|) InVars {~flag1~0=v_~flag1~0_2} OutVars{thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_7|, ~flag1~0=v_~flag1~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~f1~0#1] 12484#[$Ultimate##0, L793-4, L777]don't care [305] L777-->L755-1: Formula: true InVars {} OutVars{thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_9|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~t~1#1] 11948#[$Ultimate##0, L793-4, L755-1]don't care [2024-02-09 23:12:40,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1488615450, now seen corresponding path program 1 times [2024-02-09 23:12:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:40,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282499351] [2024-02-09 23:12:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:12:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:12:40,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash 306427369, now seen corresponding path program 1 times [2024-02-09 23:12:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:40,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77827704] [2024-02-09 23:12:40,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:12:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:12:40,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash 320886052, now seen corresponding path program 1 times [2024-02-09 23:12:40,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:40,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296211569] [2024-02-09 23:12:40,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:40,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:12:40,274 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-09 23:12:40,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:12:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296211569] [2024-02-09 23:12:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296211569] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:12:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:12:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:12:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072366053] [2024-02-09 23:12:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:12:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:12:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-09 23:12:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-09 23:12:40,299 INFO L87 Difference]: Start difference. First operand 1815 states and 5193 transitions. cyclomatic complexity: 3489 Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-09 23:12:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 23:12:40,385 INFO L93 Difference]: Finished difference Result 2317 states and 6530 transitions. [2024-02-09 23:12:40,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2317 states and 6530 transitions. [2024-02-09 23:12:40,406 INFO L131 ngComponentsAnalysis]: Automaton has 151 accepting balls. 1558 [2024-02-09 23:12:40,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2317 states to 2138 states and 6080 transitions. [2024-02-09 23:12:40,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2138 [2024-02-09 23:12:40,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2138 [2024-02-09 23:12:40,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2138 states and 6080 transitions. [2024-02-09 23:12:40,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-02-09 23:12:40,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2138 states and 6080 transitions. [2024-02-09 23:12:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states and 6080 transitions. [2024-02-09 23:12:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1734. [2024-02-09 23:12:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1734 states have (on average 2.858708189158016) internal successors, (4957), 1733 states have internal predecessors, (4957), 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-09 23:12:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 4957 transitions. [2024-02-09 23:12:40,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1734 states and 4957 transitions. [2024-02-09 23:12:40,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-09 23:12:40,482 INFO L428 stractBuchiCegarLoop]: Abstraction has 1734 states and 4957 transitions. [2024-02-09 23:12:40,482 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:12:40,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1734 states and 4957 transitions. [2024-02-09 23:12:40,493 INFO L131 ngComponentsAnalysis]: Automaton has 111 accepting balls. 1254 [2024-02-09 23:12:40,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:12:40,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:12:40,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-09 23:12:40,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-02-09 23:12:40,498 INFO L748 eck$LassoCheckResult]: Stem: 15702#[$Ultimate##0]don't care [197] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 15704#[L-1]don't care [211] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_3|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|} AuxVars[] AssignedVars[] 18178#[L16]don't care [262] L16-->L16-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 17550#[L16-1]don't care [179] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 17552#[L16-2]don't care [283] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_1| 1) 1) 0) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 17490#[L16-3]don't care [272] L16-3-->L16-4: Formula: (and (= (select |v_#valid_1| 2) 1) (= (select |v_#length_1| 2) 9)) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 17492#[L16-4]don't care [222] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 16754#[L704]don't care [227] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 16756#[L705]don't care [265] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 18074#[L706]don't care [270] L706-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 16922#[L-1-1]don't care [278] 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] 16924#[L-1-2]don't care [279] L-1-2-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 15268#[L790]don't care [241] L790-->L790-1: Formula: (and (= (store |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_2|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, 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_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 15270#[L790-1]don't care [267] L790-1-->L790-2: Formula: (and (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 17162#[L790-2]don't care [254] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, 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] 16216#[L791]don't care [200] L791-->L2: 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] 16218#[L2]don't care [239] L2-->L3: 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] 17380#[L3]don't care [230] L3-->L2-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[] 15082#[L2-1]don't care [199] L2-1-->L791-1: 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] 15070#[L791-1]don't care [196] L791-1-->L792: 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] 15072#[L792]don't care [185] L792-->L792-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 17780#[L792-1]don't care [232] L792-1-->L792-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 17978#[L792-2]don't care [198] L792-2-->L792-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= |v_#memory_int_2| (store |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)))) InVars {#valid=|v_#valid_6|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 17652#[L792-3]don't care [355] L792-3-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_10|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_18|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_~f2~0#1, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~t~0#1, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base] 17654#[L792-4, $Ultimate##0]don't care [216] L792-4-->L792-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 15850#[$Ultimate##0, L792-5]don't care [181] L792-5-->L793: 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] 15852#[$Ultimate##0, L793]don't care [212] L793-->L793-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 18122#[L793-1, $Ultimate##0]don't care [194] L793-1-->L793-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 18124#[$Ultimate##0, L793-2]don't care [240] L793-2-->L793-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_4|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_5|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 16098#[L793-3, $Ultimate##0]don't care [352] L793-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork0_thidvar0_2) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_18|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_10|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~t~1#1, thr2Thread1of1ForFork0_#in~_#1.offset, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_~f1~0#1, thr2Thread1of1ForFork0_#res#1.base] 15744#[$Ultimate##0, L793-4, $Ultimate##0]don't care [288] $Ultimate##0-->L749: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset] 15746#[$Ultimate##0, L793-4, L749]don't care [289] L749-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 17482#[$Ultimate##0, L793-4, L751]don't care [319] $Ultimate##0-->L708: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base] 15790#[L793-4, L751, L708]don't care [320] L708-->L710: Formula: (= v_~flag1~0_6 1) InVars {} OutVars{~flag1~0=v_~flag1~0_6} AuxVars[] AssignedVars[~flag1~0] 16810#[L793-4, L751, L710]don't care [321] L710-->L714-1: Formula: (= v_~flag2~0_5 |v_thr1Thread1of1ForFork1_~f2~0#1_1|) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_1|, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0#1] 15360#[L793-4, L751, L714-1]don't care [2024-02-09 23:12:40,499 INFO L750 eck$LassoCheckResult]: Loop: 15360#[L793-4, L751, L714-1]don't care [322] L714-1-->L715: Formula: (<= 1 |v_thr1Thread1of1ForFork1_~f2~0#1_3|) InVars {thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_3|} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_3|} AuxVars[] AssignedVars[] 17072#[L793-4, L751, L715]don't care [325] L715-->L717: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_1| v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0#1] 15714#[L793-4, L751, L717]don't care [328] L717-->L718: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_5| 0) InVars {thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_5|} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_5|} AuxVars[] AssignedVars[] 15720#[L793-4, L751, L718]don't care [332] L718-->L736: Formula: (= v_~flag2~0_6 |v_thr1Thread1of1ForFork1_~f2~0#1_7|) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_7|, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0#1] 15358#[L793-4, L751, L736]don't care [336] L736-->L714-1: Formula: true InVars {} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_9|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0#1] 15360#[L793-4, L751, L714-1]don't care [2024-02-09 23:12:40,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -335299772, now seen corresponding path program 1 times [2024-02-09 23:12:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:40,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662005791] [2024-02-09 23:12:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:40,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:12:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:12:40,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash 336010824, now seen corresponding path program 2 times [2024-02-09 23:12:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697668641] [2024-02-09 23:12:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:12:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:12:40,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:12:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1099631387, now seen corresponding path program 1 times [2024-02-09 23:12:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:12:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688247503] [2024-02-09 23:12:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:12:40,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:12:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:12:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:40,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:12:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:41,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:12:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:12:41,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:12:41 BoogieIcfgContainer [2024-02-09 23:12:41,646 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:12:41,647 INFO L158 Benchmark]: Toolchain (without parser) took 4243.77ms. Allocated memory is still 271.6MB. Free memory was 205.4MB in the beginning and 119.0MB in the end (delta: 86.4MB). Peak memory consumption was 86.6MB. Max. memory is 8.0GB. [2024-02-09 23:12:41,647 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:12:41,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.92ms. Allocated memory is still 271.6MB. Free memory was 205.2MB in the beginning and 234.9MB in the end (delta: -29.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2024-02-09 23:12:41,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.65ms. Allocated memory is still 271.6MB. Free memory was 234.9MB in the beginning and 232.8MB in the end (delta: 2.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-09 23:12:41,652 INFO L158 Benchmark]: Boogie Preprocessor took 40.07ms. Allocated memory is still 271.6MB. Free memory was 232.3MB in the beginning and 230.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:12:41,652 INFO L158 Benchmark]: RCFGBuilder took 442.47ms. Allocated memory is still 271.6MB. Free memory was 230.7MB in the beginning and 215.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-02-09 23:12:41,653 INFO L158 Benchmark]: BuchiAutomizer took 3211.53ms. Allocated memory is still 271.6MB. Free memory was 214.4MB in the beginning and 119.0MB in the end (delta: 95.4MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2024-02-09 23:12:41,660 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.10ms. Allocated memory is still 170.9MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 478.92ms. Allocated memory is still 271.6MB. Free memory was 205.2MB in the beginning and 234.9MB in the end (delta: -29.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.65ms. Allocated memory is still 271.6MB. Free memory was 234.9MB in the beginning and 232.8MB in the end (delta: 2.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.07ms. Allocated memory is still 271.6MB. Free memory was 232.3MB in the beginning and 230.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 442.47ms. Allocated memory is still 271.6MB. Free memory was 230.7MB in the beginning and 215.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 3211.53ms. Allocated memory is still 271.6MB. Free memory was 214.4MB in the beginning and 119.0MB in the end (delta: 95.4MB). Peak memory consumption was 94.9MB. 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 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 1734 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 877 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s 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, 241 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 624 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 270 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 714]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L704] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L705] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L706] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L790] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={24292:0}, t2={24293:0}, turn=0, x=0] [L791] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L791] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L792] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=20538, t1={24292:0}, t2={24293:0}, turn=0, x=0] [L793] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=0, flag2=0, pthread_create(&t2, 0, thr2, 0)=20539, t1={24292:0}, t2={24293:0}, turn=0, x=0] [L750] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=0, flag2=1, turn=0, x=0] [L709] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L712] 1 int f2 = flag2; VAL [_={0:0}, _={0:0}, f2=1, flag1=1, flag2=1, turn=0, x=0] Loop: [L714] COND TRUE f2 >= 1 [L716] int t = turn; [L718] COND FALSE, EXPR !(t != 0) [L735] EXPR f2 = flag2 [L714-L737] { __VERIFIER_atomic_begin(); int t = turn; __VERIFIER_atomic_end(); if (t != 0) { __VERIFIER_atomic_begin(); flag1 = 0; __VERIFIER_atomic_end(); __VERIFIER_atomic_begin(); t = turn; __VERIFIER_atomic_end(); while (t != 0) { __VERIFIER_atomic_begin(); t = turn; __VERIFIER_atomic_end(); }; __VERIFIER_atomic_begin(); flag1 = 1; __VERIFIER_atomic_end(); } __VERIFIER_atomic_begin(); f2 = flag2; __VERIFIER_atomic_end(); } End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 714]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L704] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L705] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L706] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L790] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={24292:0}, t2={24293:0}, turn=0, x=0] [L791] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L791] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L792] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=20538, t1={24292:0}, t2={24293:0}, turn=0, x=0] [L793] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=0, flag2=0, pthread_create(&t2, 0, thr2, 0)=20539, t1={24292:0}, t2={24293:0}, turn=0, x=0] [L750] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=0, flag2=1, turn=0, x=0] [L709] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L712] 1 int f2 = flag2; VAL [_={0:0}, _={0:0}, f2=1, flag1=1, flag2=1, turn=0, x=0] Loop: [L714] COND TRUE f2 >= 1 [L716] int t = turn; [L718] COND FALSE, EXPR !(t != 0) [L735] EXPR f2 = flag2 [L714-L737] { __VERIFIER_atomic_begin(); int t = turn; __VERIFIER_atomic_end(); if (t != 0) { __VERIFIER_atomic_begin(); flag1 = 0; __VERIFIER_atomic_end(); __VERIFIER_atomic_begin(); t = turn; __VERIFIER_atomic_end(); while (t != 0) { __VERIFIER_atomic_begin(); t = turn; __VERIFIER_atomic_end(); }; __VERIFIER_atomic_begin(); flag1 = 1; __VERIFIER_atomic_end(); } __VERIFIER_atomic_begin(); f2 = flag2; __VERIFIER_atomic_end(); } End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-09 23:12:41,740 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...