/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs NONE -i ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-a3464b2-m [2023-08-18 16:43:17,810 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-08-18 16:43:17,875 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-08-18 16:43:17,901 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-18 16:43:17,901 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-18 16:43:17,901 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-18 16:43:17,902 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-18 16:43:17,903 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-08-18 16:43:17,903 INFO L137 SettingsManager]: * Use SBE=true [2023-08-18 16:43:17,903 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-08-18 16:43:17,904 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-08-18 16:43:17,904 INFO L137 SettingsManager]: * Use old map elimination=false [2023-08-18 16:43:17,904 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-08-18 16:43:17,905 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-08-18 16:43:17,905 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-08-18 16:43:17,905 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-18 16:43:17,906 INFO L137 SettingsManager]: * sizeof long=4 [2023-08-18 16:43:17,906 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-18 16:43:17,906 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-18 16:43:17,906 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-08-18 16:43:17,907 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-08-18 16:43:17,907 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-08-18 16:43:17,908 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-08-18 16:43:17,908 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-08-18 16:43:17,908 INFO L137 SettingsManager]: * sizeof long double=12 [2023-08-18 16:43:17,908 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-08-18 16:43:17,909 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-08-18 16:43:17,909 INFO L137 SettingsManager]: * Use constant arrays=true [2023-08-18 16:43:17,909 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-08-18 16:43:17,910 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-18 16:43:17,910 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-18 16:43:17,910 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-18 16:43:17,911 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-18 16:43:17,911 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-08-18 16:43:17,912 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-08-18 16:43:17,912 INFO L137 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: Fairness type for concurrent programs -> NONE [2023-08-18 16:43:18,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-18 16:43:18,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-18 16:43:18,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-18 16:43:18,138 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-18 16:43:18,138 INFO L274 PluginConnector]: CDTParser initialized [2023-08-18 16:43:18,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2023-08-18 16:43:19,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-18 16:43:19,549 INFO L384 CDTParser]: Found 1 translation units. [2023-08-18 16:43:19,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2023-08-18 16:43:19,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9778f2378/9967465e62424a5db6dd50ca0045343e/FLAG8a89d060e [2023-08-18 16:43:19,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9778f2378/9967465e62424a5db6dd50ca0045343e [2023-08-18 16:43:19,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-18 16:43:19,592 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-18 16:43:19,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-18 16:43:19,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-18 16:43:19,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-18 16:43:19,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:19,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5651a1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19, skipping insertion in model container [2023-08-18 16:43:19,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:19,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-18 16:43:19,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-18 16:43:19,806 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-18 16:43:19,958 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[31505,31518] [2023-08-18 16:43:19,963 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32915,32928] [2023-08-18 16:43:19,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-18 16:43:19,983 INFO L203 MainTranslator]: Completed pre-run [2023-08-18 16:43:20,008 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-18 16:43:20,024 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[31505,31518] [2023-08-18 16:43:20,027 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32915,32928] [2023-08-18 16:43:20,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-18 16:43:20,062 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-18 16:43:20,062 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-18 16:43:20,062 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-18 16:43:20,068 INFO L208 MainTranslator]: Completed translation [2023-08-18 16:43:20,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20 WrapperNode [2023-08-18 16:43:20,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-18 16:43:20,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-18 16:43:20,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-18 16:43:20,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-18 16:43:20,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,128 INFO L138 Inliner]: procedures = 171, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-08-18 16:43:20,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-18 16:43:20,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-18 16:43:20,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-18 16:43:20,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-18 16:43:20,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-18 16:43:20,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-18 16:43:20,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-18 16:43:20,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-18 16:43:20,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (1/1) ... [2023-08-18 16:43:20,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:43:20,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:43:20,222 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) [2023-08-18 16:43:20,235 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 [2023-08-18 16:43:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-18 16:43:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-08-18 16:43:20,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-08-18 16:43:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-18 16:43:20,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-18 16:43:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-18 16:43:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-18 16:43:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-18 16:43:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-18 16:43:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-18 16:43:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-18 16:43:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-18 16:43:20,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-18 16:43:20,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-18 16:43:20,261 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-18 16:43:20,373 INFO L236 CfgBuilder]: Building ICFG [2023-08-18 16:43:20,375 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-18 16:43:20,568 INFO L277 CfgBuilder]: Performing block encoding [2023-08-18 16:43:20,574 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-18 16:43:20,574 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-08-18 16:43:20,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 04:43:20 BoogieIcfgContainer [2023-08-18 16:43:20,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-18 16:43:20,577 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-08-18 16:43:20,577 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-08-18 16:43:20,580 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-08-18 16:43:20,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:43:20,581 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.08 04:43:19" (1/3) ... [2023-08-18 16:43:20,582 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d27b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.08 04:43:20, skipping insertion in model container [2023-08-18 16:43:20,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:43:20,583 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:20" (2/3) ... [2023-08-18 16:43:20,584 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d27b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.08 04:43:20, skipping insertion in model container [2023-08-18 16:43:20,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:43:20,584 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 04:43:20" (3/3) ... [2023-08-18 16:43:20,585 INFO L332 chiAutomizerObserver]: Analyzing ICFG szymanski.i [2023-08-18 16:43:20,660 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-18 16:43:20,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 113 transitions, 242 flow [2023-08-18 16:43:20,713 INFO L124 PetriNetUnfolderBase]: 20/109 cut-off events. [2023-08-18 16:43:20,713 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-18 16:43:20,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 20/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 81. Up to 3 conditions per place. [2023-08-18 16:43:20,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 113 transitions, 242 flow [2023-08-18 16:43:20,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 109 transitions, 230 flow [2023-08-18 16:43:20,732 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-08-18 16:43:20,732 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-08-18 16:43:20,732 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-08-18 16:43:20,732 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-08-18 16:43:20,732 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-08-18 16:43:20,732 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-08-18 16:43:20,732 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-08-18 16:43:20,732 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-08-18 16:43:20,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-08-18 16:43:21,156 INFO L131 ngComponentsAnalysis]: Automaton has 676 accepting balls. 1480 [2023-08-18 16:43:21,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:21,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:21,161 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] [2023-08-18 16:43:21,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-08-18 16:43:21,161 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-08-18 16:43:21,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2964 states, but on-demand construction may add more states [2023-08-18 16:43:21,218 INFO L131 ngComponentsAnalysis]: Automaton has 676 accepting balls. 1480 [2023-08-18 16:43:21,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:21,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:21,220 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] [2023-08-18 16:43:21,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-08-18 16:43:21,229 INFO L748 eck$LassoCheckResult]: Stem: 101#[$Ultimate##0]don't care [239] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 104#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 106#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 108#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 110#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 112#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 114#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 116#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 118#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 120#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 122#[L-1-2]don't care [296] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 124#[L-1-3]don't care [298] L-1-3-->L817: 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_3|, 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_2|, 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_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 126#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 128#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 130#[L817-2]don't care [207] L817-2-->L818: 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] 132#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 134#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} AuxVars[] AssignedVars[#memory_int] 136#[L818-2]don't care [382] L818-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 138#[L818-3, $Ultimate##0]don't care [345] $Ultimate##0-->L703: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset] 142#[L818-3, L703]don't care [346] L703-->L705: Formula: (= v_~flag1~0_10 1) InVars {} OutVars{~flag1~0=v_~flag1~0_10} AuxVars[] AssignedVars[~flag1~0] 148#[L818-3, L705]don't care [347] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 156#[L818-3, L712]don't care [2023-08-18 16:43:21,230 INFO L750 eck$LassoCheckResult]: Loop: 156#[L818-3, L712]don't care [348] L712-->L710: Formula: (<= 3 v_thr1Thread1of1ForFork0_~f21~0_3) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3} AuxVars[] AssignedVars[] 166#[L710, L818-3]don't care [351] L710-->L712: Formula: (= v_thr1Thread1of1ForFork0_~f21~0_7 v_~flag2~0_10) InVars {~flag2~0=v_~flag2~0_10} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_7, ~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 156#[L818-3, L712]don't care [2023-08-18 16:43:21,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1499277610, now seen corresponding path program 1 times [2023-08-18 16:43:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:21,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199263337] [2023-08-18 16:43:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:21,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:21,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:21,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash 12100, now seen corresponding path program 1 times [2023-08-18 16:43:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:21,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116991320] [2023-08-18 16:43:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:21,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:21,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:21,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1991727911, now seen corresponding path program 1 times [2023-08-18 16:43:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907641023] [2023-08-18 16:43:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:43:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 16:43:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-18 16:43:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907641023] [2023-08-18 16:43:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907641023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-18 16:43:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-18 16:43:21,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-18 16:43:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51882206] [2023-08-18 16:43:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-18 16:43:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-18 16:43:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-18 16:43:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-18 16:43:21,687 INFO L87 Difference]: Start difference. First operand currently 2964 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-08-18 16:43:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-08-18 16:43:21,942 INFO L93 Difference]: Finished difference Result 4508 states and 13098 transitions. [2023-08-18 16:43:21,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4508 states and 13098 transitions. [2023-08-18 16:43:21,997 INFO L131 ngComponentsAnalysis]: Automaton has 852 accepting balls. 1832 [2023-08-18 16:43:22,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4508 states to 3928 states and 11529 transitions. [2023-08-18 16:43:22,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3928 [2023-08-18 16:43:22,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3928 [2023-08-18 16:43:22,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3928 states and 11529 transitions. [2023-08-18 16:43:22,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-18 16:43:22,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3928 states and 11529 transitions. [2023-08-18 16:43:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states and 11529 transitions. [2023-08-18 16:43:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 2879. [2023-08-18 16:43:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2879 states have (on average 2.975686002084057) internal successors, (8567), 2878 states have internal predecessors, (8567), 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) [2023-08-18 16:43:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 8567 transitions. [2023-08-18 16:43:22,299 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2879 states and 8567 transitions. [2023-08-18 16:43:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-18 16:43:22,305 INFO L428 stractBuchiCegarLoop]: Abstraction has 2879 states and 8567 transitions. [2023-08-18 16:43:22,305 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-08-18 16:43:22,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2879 states and 8567 transitions. [2023-08-18 16:43:22,364 INFO L131 ngComponentsAnalysis]: Automaton has 648 accepting balls. 1424 [2023-08-18 16:43:22,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:22,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:22,365 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] [2023-08-18 16:43:22,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-08-18 16:43:22,367 INFO L748 eck$LassoCheckResult]: Stem: 11975#[$Ultimate##0]don't care [239] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 11977#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 13985#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 13987#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 16063#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 14455#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 14457#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 13251#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 13253#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 15123#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 15557#[L-1-2]don't care [296] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 14893#[L-1-3]don't care [298] L-1-3-->L817: 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_3|, 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_2|, 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_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 11053#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 11055#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 16147#[L817-2]don't care [207] L817-2-->L818: 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] 15167#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 15169#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} AuxVars[] AssignedVars[#memory_int] 10769#[L818-2]don't care [382] L818-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 10771#[L818-3, $Ultimate##0]don't care [273] L818-3-->L818-4: 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] 11123#[L818-4, $Ultimate##0]don't care [253] L818-4-->L819: 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] 11127#[L819, $Ultimate##0]don't care [272] L819-->L819-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] 16005#[L819-1, $Ultimate##0]don't care [214] L819-1-->L819-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 11499#[L819-2, $Ultimate##0]don't care [249] L819-2-->L819-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5|))) 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_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} 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_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] 11501#[L819-3, $Ultimate##0]don't care [385] L819-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 11525#[$Ultimate##0, $Ultimate##0, L819-4]don't care [310] $Ultimate##0-->L760: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base] 16093#[$Ultimate##0, L760, L819-4]don't care [311] L760-->L762: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 14889#[L762, $Ultimate##0, L819-4]don't care [312] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 13181#[L769, $Ultimate##0, L819-4]don't care [2023-08-18 16:43:22,367 INFO L750 eck$LassoCheckResult]: Loop: 13181#[L769, $Ultimate##0, L819-4]don't care [313] L769-->L767: Formula: (<= 3 v_thr2Thread1of1ForFork1_~f12~0_3) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} AuxVars[] AssignedVars[] 13175#[$Ultimate##0, L767, L819-4]don't care [316] L767-->L769: Formula: (= v_~flag1~0_3 v_thr2Thread1of1ForFork1_~f12~0_7) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 13181#[L769, $Ultimate##0, L819-4]don't care [2023-08-18 16:43:22,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash -550132775, now seen corresponding path program 1 times [2023-08-18 16:43:22,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147458689] [2023-08-18 16:43:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:22,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash 10980, now seen corresponding path program 1 times [2023-08-18 16:43:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285196759] [2023-08-18 16:43:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:22,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash -396609348, now seen corresponding path program 1 times [2023-08-18 16:43:22,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357163869] [2023-08-18 16:43:22,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:43:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 16:43:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-18 16:43:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357163869] [2023-08-18 16:43:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357163869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-18 16:43:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-18 16:43:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-18 16:43:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902526932] [2023-08-18 16:43:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-18 16:43:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-18 16:43:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-18 16:43:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-18 16:43:22,557 INFO L87 Difference]: Start difference. First operand 2879 states and 8567 transitions. cyclomatic complexity: 6336 Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2023-08-18 16:43:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-08-18 16:43:22,694 INFO L93 Difference]: Finished difference Result 4154 states and 12105 transitions. [2023-08-18 16:43:22,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4154 states and 12105 transitions. [2023-08-18 16:43:22,739 INFO L131 ngComponentsAnalysis]: Automaton has 791 accepting balls. 1710 [2023-08-18 16:43:22,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4154 states to 3723 states and 10957 transitions. [2023-08-18 16:43:22,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3723 [2023-08-18 16:43:22,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3723 [2023-08-18 16:43:22,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3723 states and 10957 transitions. [2023-08-18 16:43:22,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-18 16:43:22,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3723 states and 10957 transitions. [2023-08-18 16:43:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states and 10957 transitions. [2023-08-18 16:43:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 2893. [2023-08-18 16:43:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2893 states have (on average 2.979260283442793) internal successors, (8619), 2892 states have internal predecessors, (8619), 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) [2023-08-18 16:43:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 8619 transitions. [2023-08-18 16:43:22,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2893 states and 8619 transitions. [2023-08-18 16:43:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-18 16:43:22,887 INFO L428 stractBuchiCegarLoop]: Abstraction has 2893 states and 8619 transitions. [2023-08-18 16:43:22,887 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-08-18 16:43:22,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2893 states and 8619 transitions. [2023-08-18 16:43:22,904 INFO L131 ngComponentsAnalysis]: Automaton has 635 accepting balls. 1398 [2023-08-18 16:43:22,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:22,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:22,906 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] [2023-08-18 16:43:22,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-08-18 16:43:22,909 INFO L748 eck$LassoCheckResult]: Stem: 21672#[$Ultimate##0]don't care [239] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 21674#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 23518#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 23520#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 25672#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 23960#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 23962#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 22822#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 22824#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 24634#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 25074#[L-1-2]don't care [296] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 24414#[L-1-3]don't care [298] L-1-3-->L817: 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_3|, 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_2|, 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_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 20924#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 20926#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 25776#[L817-2]don't care [207] L817-2-->L818: 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] 24682#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 24684#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} AuxVars[] AssignedVars[#memory_int] 20674#[L818-2]don't care [382] L818-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 20676#[L818-3, $Ultimate##0]don't care [273] L818-3-->L818-4: 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] 20976#[L818-4, $Ultimate##0]don't care [345] $Ultimate##0-->L703: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset] 20978#[L818-4, L703]don't care [346] L703-->L705: Formula: (= v_~flag1~0_10 1) InVars {} OutVars{~flag1~0=v_~flag1~0_10} AuxVars[] AssignedVars[~flag1~0] 23924#[L818-4, L705]don't care [253] L818-4-->L819: 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] 24998#[L819, L705]don't care [272] L819-->L819-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] 23164#[L819-1, L705]don't care [214] L819-1-->L819-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 24616#[L819-2, L705]don't care [249] L819-2-->L819-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5|))) 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_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} 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_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] 22788#[L819-3, L705]don't care [385] L819-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 25736#[L705, $Ultimate##0, L819-4]don't care [310] $Ultimate##0-->L760: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base] 21644#[L705, L760, L819-4]don't care [311] L760-->L762: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 20760#[L762, L705, L819-4]don't care [312] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 20762#[L705, L769, L819-4]don't care [2023-08-18 16:43:22,909 INFO L750 eck$LassoCheckResult]: Loop: 20762#[L705, L769, L819-4]don't care [313] L769-->L767: Formula: (<= 3 v_thr2Thread1of1ForFork1_~f12~0_3) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} AuxVars[] AssignedVars[] 24500#[L705, L767, L819-4]don't care [316] L767-->L769: Formula: (= v_~flag1~0_3 v_thr2Thread1of1ForFork1_~f12~0_7) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 20762#[L705, L769, L819-4]don't care [2023-08-18 16:43:22,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash -75534662, now seen corresponding path program 1 times [2023-08-18 16:43:22,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921026458] [2023-08-18 16:43:22,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:22,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 10980, now seen corresponding path program 2 times [2023-08-18 16:43:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067007734] [2023-08-18 16:43:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:22,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 425643869, now seen corresponding path program 1 times [2023-08-18 16:43:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106885778] [2023-08-18 16:43:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:43:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 16:43:23,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-18 16:43:23,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106885778] [2023-08-18 16:43:23,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106885778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-18 16:43:23,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-18 16:43:23,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-18 16:43:23,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552190421] [2023-08-18 16:43:23,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-18 16:43:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-18 16:43:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-18 16:43:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-18 16:43:23,088 INFO L87 Difference]: Start difference. First operand 2893 states and 8619 transitions. cyclomatic complexity: 6361 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2023-08-18 16:43:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-08-18 16:43:23,195 INFO L93 Difference]: Finished difference Result 3882 states and 11324 transitions. [2023-08-18 16:43:23,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3882 states and 11324 transitions. [2023-08-18 16:43:23,231 INFO L131 ngComponentsAnalysis]: Automaton has 795 accepting balls. 1694 [2023-08-18 16:43:23,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3882 states to 3874 states and 11310 transitions. [2023-08-18 16:43:23,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3874 [2023-08-18 16:43:23,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3874 [2023-08-18 16:43:23,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3874 states and 11310 transitions. [2023-08-18 16:43:23,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-18 16:43:23,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3874 states and 11310 transitions. [2023-08-18 16:43:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states and 11310 transitions. [2023-08-18 16:43:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 2885. [2023-08-18 16:43:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2885 states have (on average 2.9493934142114386) internal successors, (8509), 2884 states have internal predecessors, (8509), 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) [2023-08-18 16:43:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 8509 transitions. [2023-08-18 16:43:23,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2885 states and 8509 transitions. [2023-08-18 16:43:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-18 16:43:23,422 INFO L428 stractBuchiCegarLoop]: Abstraction has 2885 states and 8509 transitions. [2023-08-18 16:43:23,422 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-08-18 16:43:23,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2885 states and 8509 transitions. [2023-08-18 16:43:23,441 INFO L131 ngComponentsAnalysis]: Automaton has 611 accepting balls. 1326 [2023-08-18 16:43:23,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:23,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:23,443 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] [2023-08-18 16:43:23,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-08-18 16:43:23,445 INFO L748 eck$LassoCheckResult]: Stem: 31327#[$Ultimate##0]don't care [239] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 31329#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 33127#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 33129#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 35237#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 33563#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 33565#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 32477#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 32479#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 34181#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 34637#[L-1-2]don't care [296] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 33963#[L-1-3]don't care [298] L-1-3-->L817: 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_3|, 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_2|, 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_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 30579#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 30581#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 35337#[L817-2]don't care [207] L817-2-->L818: 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] 34233#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 34235#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} AuxVars[] AssignedVars[#memory_int] 30353#[L818-2]don't care [382] L818-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 30355#[L818-3, $Ultimate##0]don't care [273] L818-3-->L818-4: 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] 30641#[L818-4, $Ultimate##0]don't care [345] $Ultimate##0-->L703: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset] 30643#[L818-4, L703]don't care [346] L703-->L705: Formula: (= v_~flag1~0_10 1) InVars {} OutVars{~flag1~0=v_~flag1~0_10} AuxVars[] AssignedVars[~flag1~0] 33523#[L818-4, L705]don't care [253] L818-4-->L819: 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] 34561#[L819, L705]don't care [272] L819-->L819-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] 32813#[L819-1, L705]don't care [214] L819-1-->L819-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 34159#[L819-2, L705]don't care [249] L819-2-->L819-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5|))) 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_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} 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_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] 32439#[L819-3, L705]don't care [385] L819-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 35293#[L705, $Ultimate##0, L819-4]don't care [310] $Ultimate##0-->L760: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base] 31299#[L705, L760, L819-4]don't care [311] L760-->L762: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 30435#[L762, L705, L819-4]don't care [347] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 30439#[L762, L712, L819-4]don't care [2023-08-18 16:43:23,445 INFO L750 eck$LassoCheckResult]: Loop: 30439#[L762, L712, L819-4]don't care [348] L712-->L710: Formula: (<= 3 v_thr1Thread1of1ForFork0_~f21~0_3) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3} AuxVars[] AssignedVars[] 35089#[L762, L710, L819-4]don't care [351] L710-->L712: Formula: (= v_thr1Thread1of1ForFork0_~f21~0_7 v_~flag2~0_10) InVars {~flag2~0=v_~flag2~0_10} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_7, ~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 30439#[L762, L712, L819-4]don't care [2023-08-18 16:43:23,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash -75534627, now seen corresponding path program 1 times [2023-08-18 16:43:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713483333] [2023-08-18 16:43:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:23,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash 12100, now seen corresponding path program 2 times [2023-08-18 16:43:23,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:23,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221731110] [2023-08-18 16:43:23,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:23,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 425678624, now seen corresponding path program 1 times [2023-08-18 16:43:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877421281] [2023-08-18 16:43:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:43:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 16:43:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-18 16:43:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877421281] [2023-08-18 16:43:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877421281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-18 16:43:23,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-18 16:43:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-18 16:43:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673701857] [2023-08-18 16:43:23,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-18 16:43:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-18 16:43:23,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-18 16:43:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-18 16:43:23,586 INFO L87 Difference]: Start difference. First operand 2885 states and 8509 transitions. cyclomatic complexity: 6235 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) [2023-08-18 16:43:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-08-18 16:43:23,690 INFO L93 Difference]: Finished difference Result 3808 states and 11012 transitions. [2023-08-18 16:43:23,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3808 states and 11012 transitions. [2023-08-18 16:43:23,722 INFO L131 ngComponentsAnalysis]: Automaton has 754 accepting balls. 1596 [2023-08-18 16:43:23,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3808 states to 3800 states and 10998 transitions. [2023-08-18 16:43:23,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3800 [2023-08-18 16:43:23,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3800 [2023-08-18 16:43:23,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3800 states and 10998 transitions. [2023-08-18 16:43:23,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-18 16:43:23,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3800 states and 10998 transitions. [2023-08-18 16:43:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states and 10998 transitions. [2023-08-18 16:43:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 2889. [2023-08-18 16:43:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2889 states have (on average 2.924195223260644) internal successors, (8448), 2888 states have internal predecessors, (8448), 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) [2023-08-18 16:43:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 8448 transitions. [2023-08-18 16:43:23,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2889 states and 8448 transitions. [2023-08-18 16:43:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-18 16:43:23,876 INFO L428 stractBuchiCegarLoop]: Abstraction has 2889 states and 8448 transitions. [2023-08-18 16:43:23,876 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-08-18 16:43:23,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2889 states and 8448 transitions. [2023-08-18 16:43:23,894 INFO L131 ngComponentsAnalysis]: Automaton has 591 accepting balls. 1270 [2023-08-18 16:43:23,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:23,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:23,897 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] [2023-08-18 16:43:23,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-08-18 16:43:23,898 INFO L748 eck$LassoCheckResult]: Stem: 40882#[$Ultimate##0]don't care [239] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 40884#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 42594#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 42596#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 44718#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 43038#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 43040#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 41974#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 41976#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 43652#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 44102#[L-1-2]don't care [296] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 43446#[L-1-3]don't care [298] L-1-3-->L817: 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_3|, 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_2|, 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_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 40154#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 40156#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 44834#[L817-2]don't care [207] L817-2-->L818: 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] 43700#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 43702#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, 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_5|} AuxVars[] AssignedVars[#memory_int] 39938#[L818-2]don't care [382] L818-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 39940#[L818-3, $Ultimate##0]don't care [273] L818-3-->L818-4: 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] 40218#[L818-4, $Ultimate##0]don't care [345] $Ultimate##0-->L703: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset] 40220#[L818-4, L703]don't care [346] L703-->L705: Formula: (= v_~flag1~0_10 1) InVars {} OutVars{~flag1~0=v_~flag1~0_10} AuxVars[] AssignedVars[~flag1~0] 42998#[L818-4, L705]don't care [347] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 44904#[L818-4, L712]don't care [253] L818-4-->L819: 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] 44030#[L712, L819]don't care [272] L819-->L819-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] 42808#[L819-1, L712]don't care [214] L819-1-->L819-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 42810#[L819-2, L712]don't care [249] L819-2-->L819-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5|))) 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_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} 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_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] 41960#[L712, L819-3]don't care [385] L819-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 41962#[L712, $Ultimate##0, L819-4]don't care [310] $Ultimate##0-->L760: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base] 40850#[L712, L760, L819-4]don't care [311] L760-->L762: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 40022#[L762, L712, L819-4]don't care [349] L712-->L709-1: Formula: (< v_thr1Thread1of1ForFork0_~f21~0_5 3) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_5} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_5} AuxVars[] AssignedVars[] 44594#[L762, L709-1, L819-4]don't care [352] L709-1-->L716: Formula: (= v_~flag1~0_12 3) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0] 41292#[L762, L716, L819-4]don't care [312] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 41296#[L716, L769, L819-4]don't care [2023-08-18 16:43:23,899 INFO L750 eck$LassoCheckResult]: Loop: 41296#[L716, L769, L819-4]don't care [313] L769-->L767: Formula: (<= 3 v_thr2Thread1of1ForFork1_~f12~0_3) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} AuxVars[] AssignedVars[] 43800#[L716, L767, L819-4]don't care [316] L767-->L769: Formula: (= v_~flag1~0_3 v_thr2Thread1of1ForFork1_~f12~0_7) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 41296#[L716, L769, L819-4]don't care [2023-08-18 16:43:23,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1717000822, now seen corresponding path program 1 times [2023-08-18 16:43:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:23,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694847896] [2023-08-18 16:43:23,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:23,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:23,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash 10980, now seen corresponding path program 3 times [2023-08-18 16:43:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006371489] [2023-08-18 16:43:23,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:23,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash 770358297, now seen corresponding path program 1 times [2023-08-18 16:43:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:23,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906477477] [2023-08-18 16:43:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:24,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:25,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.08 04:43:25 BoogieIcfgContainer [2023-08-18 16:43:25,054 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-08-18 16:43:25,054 INFO L158 Benchmark]: Toolchain (without parser) took 5462.12ms. Allocated memory was 337.6MB in the beginning and 493.9MB in the end (delta: 156.2MB). Free memory was 279.9MB in the beginning and 366.8MB in the end (delta: -86.9MB). Peak memory consumption was 71.4MB. Max. memory is 8.0GB. [2023-08-18 16:43:25,055 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-08-18 16:43:25,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.97ms. Allocated memory is still 337.6MB. Free memory was 279.4MB in the beginning and 259.5MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-08-18 16:43:25,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.48ms. Allocated memory is still 337.6MB. Free memory was 259.5MB in the beginning and 257.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-08-18 16:43:25,056 INFO L158 Benchmark]: Boogie Preprocessor took 53.86ms. Allocated memory is still 337.6MB. Free memory was 257.4MB in the beginning and 255.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-08-18 16:43:25,056 INFO L158 Benchmark]: RCFGBuilder took 392.82ms. Allocated memory is still 337.6MB. Free memory was 255.8MB in the beginning and 240.6MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-08-18 16:43:25,057 INFO L158 Benchmark]: BuchiAutomizer took 4476.53ms. Allocated memory was 337.6MB in the beginning and 493.9MB in the end (delta: 156.2MB). Free memory was 240.1MB in the beginning and 366.8MB in the end (delta: -126.7MB). Peak memory consumption was 31.6MB. Max. memory is 8.0GB. [2023-08-18 16:43:25,059 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.11ms. Allocated memory is still 200.3MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.97ms. Allocated memory is still 337.6MB. Free memory was 279.4MB in the beginning and 259.5MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.48ms. Allocated memory is still 337.6MB. Free memory was 259.5MB in the beginning and 257.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.86ms. Allocated memory is still 337.6MB. Free memory was 257.4MB in the beginning and 255.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 392.82ms. Allocated memory is still 337.6MB. Free memory was 255.8MB in the beginning and 240.6MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 4476.53ms. Allocated memory was 337.6MB in the beginning and 493.9MB in the end (delta: 156.2MB). Free memory was 240.1MB in the beginning and 366.8MB in the end (delta: -126.7MB). Peak memory consumption was 31.6MB. 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 2889 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 4 MinimizatonAttempts, 3779 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.3s 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, 436 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 1230 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 695 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 307 IncrementalHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 535 mSDtfsCounter, 307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 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: 766]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L700] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L701] 0 int x; VAL [flag1=0, flag2=0, x=0] [L817] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={31061:0}, t2={31062:0}, x=0] [L818] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=18836, t1={31061:0}, t2={31062:0}, x=0] [L704] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L707] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, f21=0, flag1=1, flag2=0, x=0] [L819] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [_={0:0}, _={0:0}, _={0:0}, f21=0, flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=18837, t1={31061:0}, t2={31062:0}, x=0] [L761] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=0, flag1=1, flag2=1, x=0] [L709] COND FALSE 1 !(f21 >= 3) VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=0, flag1=1, flag2=1, x=0] [L715] 1 flag1 = 3 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=0, flag1=3, flag2=1, x=0] [L764] 2 int f12 = flag1; VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f12=3, f21=0, flag1=3, flag2=1, x=0] Loop: [L766] COND TRUE f12 >= 3 [L768] f12 = flag1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 766]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L701] 0 int x; VAL [flag1=0, flag2=0, x=0] [L817] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={31061:0}, t2={31062:0}, x=0] [L818] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=18836, t1={31061:0}, t2={31062:0}, x=0] [L704] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L707] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, f21=0, flag1=1, flag2=0, x=0] [L819] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [_={0:0}, _={0:0}, _={0:0}, f21=0, flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=18837, t1={31061:0}, t2={31062:0}, x=0] [L761] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=0, flag1=1, flag2=1, x=0] [L709] COND FALSE 1 !(f21 >= 3) VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=0, flag1=1, flag2=1, x=0] [L715] 1 flag1 = 3 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=0, flag1=3, flag2=1, x=0] [L764] 2 int f12 = flag1; VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f12=3, f21=0, flag1=3, flag2=1, x=0] Loop: [L766] COND TRUE f12 >= 3 [L768] f12 = flag1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-08-18 16:43:25,143 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...