/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 FAIRNESS_INTERSECTION -i ../../../trunk/examples/svcomp/pthread-lit/fk2012.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:31:16,019 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:31:16,087 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-09-17 11:31:16,111 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:31:16,111 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:31:16,112 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:31:16,113 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:31:16,113 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:31:16,113 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:31:16,116 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:31:16,117 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:31:16,117 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:31:16,117 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:31:16,118 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:31:16,118 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:31:16,119 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:31:16,119 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:31:16,119 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:31:16,119 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:31:16,119 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:31:16,120 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:31:16,120 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:31:16,120 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:31:16,121 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:31:16,121 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:31:16,121 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:31:16,121 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:31:16,121 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:31:16,121 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:31:16,122 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:31:16,122 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:31:16,122 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:31:16,123 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:31:16,123 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:31:16,124 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:31:16,124 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 -> FAIRNESS_INTERSECTION [2023-09-17 11:31:16,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:31:16,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:31:16,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:31:16,342 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:31:16,342 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:31:16,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fk2012.i [2023-09-17 11:31:17,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:31:17,621 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:31:17,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fk2012.i [2023-09-17 11:31:17,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e5bacb9/5668fa0fe2cb4788a757f192b2a7ba76/FLAG1010799dd [2023-09-17 11:31:17,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e5bacb9/5668fa0fe2cb4788a757f192b2a7ba76 [2023-09-17 11:31:17,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:31:17,653 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:31:17,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:31:17,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:31:17,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:31:17,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:31:17" (1/1) ... [2023-09-17 11:31:17,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c70b270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:17, skipping insertion in model container [2023-09-17 11:31:17,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:31:17" (1/1) ... [2023-09-17 11:31:17,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:31:17,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:31:17,824 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-lit/fk2012.i[800,813] [2023-09-17 11:31:18,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:31:18,025 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:31:18,036 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-lit/fk2012.i[800,813] [2023-09-17 11:31:18,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:31:18,103 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:31:18,103 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:31:18,108 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:31:18,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18 WrapperNode [2023-09-17 11:31:18,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:31:18,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:31:18,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:31:18,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:31:18,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,155 INFO L138 Inliner]: procedures = 277, calls = 35, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 158 [2023-09-17 11:31:18,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:31:18,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:31:18,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:31:18,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:31:18,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:31:18,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:31:18,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:31:18,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:31:18,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (1/1) ... [2023-09-17 11:31:18,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:31:18,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:31:18,220 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-09-17 11:31:18,228 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-09-17 11:31:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:31:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:31:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:31:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:31:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:31:18,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:31:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure producer [2023-09-17 11:31:18,247 INFO L138 BoogieDeclarations]: Found implementation of procedure producer [2023-09-17 11:31:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure consumer [2023-09-17 11:31:18,247 INFO L138 BoogieDeclarations]: Found implementation of procedure consumer [2023-09-17 11:31:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:31:18,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:31:18,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:31:18,248 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 11:31:18,367 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:31:18,368 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:31:18,595 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:31:18,649 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:31:18,649 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-17 11:31:18,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:31:18 BoogieIcfgContainer [2023-09-17 11:31:18,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:31:18,652 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:31:18,652 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:31:18,654 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:31:18,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:31:18,655 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:31:17" (1/3) ... [2023-09-17 11:31:18,656 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6220d86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:31:18, skipping insertion in model container [2023-09-17 11:31:18,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:31:18,656 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:31:18" (2/3) ... [2023-09-17 11:31:18,656 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6220d86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:31:18, skipping insertion in model container [2023-09-17 11:31:18,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:31:18,657 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:31:18" (3/3) ... [2023-09-17 11:31:18,658 INFO L332 chiAutomizerObserver]: Analyzing ICFG fk2012.i [2023-09-17 11:31:18,739 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:31:18,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 102 transitions, 214 flow [2023-09-17 11:31:18,820 INFO L124 PetriNetUnfolderBase]: 23/225 cut-off events. [2023-09-17 11:31:18,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:31:18,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 225 events. 23/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 791 event pairs, 1 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2023-09-17 11:31:18,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 102 transitions, 214 flow [2023-09-17 11:31:18,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 102 transitions, 214 flow [2023-09-17 11:31:18,845 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:31:18,845 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:31:18,845 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:31:18,845 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:31:18,845 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:31:18,845 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:31:18,845 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:31:18,846 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:31:18,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 11:31:24,319 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 1860 [2023-09-17 11:31:24,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:31:24,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:31:24,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:31:24,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-17 11:31:24,326 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:31:24,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 11:31:27,460 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 1860 [2023-09-17 11:31:27,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:31:27,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:31:27,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:31:27,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-17 11:31:27,471 INFO L748 eck$LassoCheckResult]: Stem: 107#[$Ultimate##0]don't care [329] $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] 113#[L-1]don't care [338] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 118#[L-1-1]don't care [372] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 121#[L12]don't care [314] L12-->L12-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_6| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 124#[L12-1]don't care [333] L12-1-->L12-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 127#[L12-2]don't care [332] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 130#[L12-3]don't care [360] L12-3-->L12-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= 9 (select |v_#length_4| 2))) InVars {#length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 133#[L12-4]don't care [347] L12-4-->L1001: Formula: (= v_~lock1~0_7 0) InVars {} OutVars{~lock1~0=v_~lock1~0_7} AuxVars[] AssignedVars[~lock1~0] 136#[L1001]don't care [330] L1001-->L1002: Formula: (= v_~lock2~0_7 0) InVars {} OutVars{~lock2~0=v_~lock2~0_7} AuxVars[] AssignedVars[~lock2~0] 139#[L1002]don't care [303] L1002-->L-1-2: Formula: (= v_~counter~0_9 0) InVars {} OutVars{~counter~0=v_~counter~0_9} AuxVars[] AssignedVars[~counter~0] 142#[L-1-2]don't care [376] 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] 145#[L-1-3]don't care [379] L-1-3-->L1060: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_6|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t~0#1.base] 148#[L1060]don't care [306] L1060-->L1060-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t~0#1.base_6| 1)) (= |v_ULTIMATE.start_main_~#t~0#1.offset_6| 0) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t~0#1.base_6|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_6| 0)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t~0#1.base_6| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_6|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 151#[L1060-1]don't care [351] L1060-1-->L1062: Formula: (= v_~counter~0_10 0) InVars {} OutVars{~counter~0=v_~counter~0_10} AuxVars[] AssignedVars[~counter~0] 154#[L1062]don't care [309] L1062-->L1063: Formula: (= v_~lock1~0_8 0) InVars {} OutVars{~lock1~0=v_~lock1~0_8} AuxVars[] AssignedVars[~lock1~0] 157#[L1063]don't care [307] L1063-->L1064: Formula: (= v_~lock2~0_8 0) InVars {} OutVars{~lock2~0=v_~lock2~0_8} AuxVars[] AssignedVars[~lock2~0] 160#[L1064]don't care [373] L1064-->L1066-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 163#[L1066-5]don't care [385] L1066-5-->L1066: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 168#[L1066]don't care [390] L1066-->L1066-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 172#[L1066-1]don't care [358] L1066-1-->L1066-4: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| 0) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[] 181#[L1066-4]don't care [318] L1066-4-->L1069: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 190#[L1069]don't care [304] L1069-->L1069-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 199#[L1069-1]don't care [348] L1069-1-->L1069-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 208#[L1069-2]don't care [302] L1069-2-->L1069-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_2| 4) (select |v_#length_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_2|) |v_ULTIMATE.start_main_~#t~0#1.offset_2| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_3|) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_2|) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 1)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, #length=|v_#length_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, #length=|v_#length_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|} AuxVars[] AssignedVars[#memory_int] 220#[L1069-3]don't care [454] L1069-3-->$Ultimate##0: Formula: (and (= v_consumerThread1of1ForFork1_thidvar1_2 0) (= |v_consumerThread1of1ForFork1_#in~arg#1.base_4| 0) (= v_consumerThread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= |v_consumerThread1of1ForFork1_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_8|, consumerThread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_consumerThread1of1ForFork1___VERIFIER_assert_#in~cond#1_6|, consumerThread1of1ForFork1_~arg#1.base=|v_consumerThread1of1ForFork1_~arg#1.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, consumerThread1of1ForFork1_~arg#1.offset=|v_consumerThread1of1ForFork1_~arg#1.offset_4|, consumerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_8|, consumerThread1of1ForFork1___VERIFIER_assert_~cond#1=|v_consumerThread1of1ForFork1___VERIFIER_assert_~cond#1_10|, consumerThread1of1ForFork1_#res#1.base=|v_consumerThread1of1ForFork1_#res#1.base_4|, consumerThread1of1ForFork1_thidvar1=v_consumerThread1of1ForFork1_thidvar1_2, consumerThread1of1ForFork1_thidvar0=v_consumerThread1of1ForFork1_thidvar0_2, consumerThread1of1ForFork1_#res#1.offset=|v_consumerThread1of1ForFork1_#res#1.offset_4|, consumerThread1of1ForFork1_#in~arg#1.offset=|v_consumerThread1of1ForFork1_#in~arg#1.offset_4|, consumerThread1of1ForFork1_#t~post7#1=|v_consumerThread1of1ForFork1_#t~post7#1_8|, consumerThread1of1ForFork1_#in~arg#1.base=|v_consumerThread1of1ForFork1_#in~arg#1.base_4|} AuxVars[] AssignedVars[consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1, consumerThread1of1ForFork1___VERIFIER_assert_#in~cond#1, consumerThread1of1ForFork1_~arg#1.base, consumerThread1of1ForFork1_~arg#1.offset, consumerThread1of1ForFork1_assume_abort_if_not_~cond#1, consumerThread1of1ForFork1___VERIFIER_assert_~cond#1, consumerThread1of1ForFork1_#res#1.base, consumerThread1of1ForFork1_thidvar1, consumerThread1of1ForFork1_thidvar0, consumerThread1of1ForFork1_#res#1.offset, consumerThread1of1ForFork1_#in~arg#1.offset, consumerThread1of1ForFork1_#t~post7#1, consumerThread1of1ForFork1_#in~arg#1.base] 231#[$Ultimate##0, L1069-4]don't care [325] L1069-4-->L1069-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 248#[$Ultimate##0, L1069-5]don't care [363] L1069-5-->L1066-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 272#[$Ultimate##0, L1066-5]don't care [387] L1066-5-->L1065-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] 319#[$Ultimate##0, L1065-2]don't care [336] L1065-2-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#res#1_1| 0) InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 393#[$Ultimate##0, L1060-2]don't care [391] L1060-2-->L1060-3: Formula: (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| 0) |v_#valid_3|) InVars {ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid] 530#[$Ultimate##0, L1060-3]don't care [356] L1060-3-->main_returnLabel#1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_~#t~0#1.base] 744#[$Ultimate##0, main_returnLabel#1]don't care [378] main_returnLabel#1-->ULTIMATE.startFINAL: Formula: (= |v_ULTIMATE.start_main_#res#1_2| |v_ULTIMATE.start_#t~ret13#1_1|) InVars {ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret13#1] 1037#[$Ultimate##0, ULTIMATE.startFINAL]don't care [392] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1415#[$Ultimate##0, ULTIMATE.startEXIT]don't care [425] $Ultimate##0-->L1049-2: Formula: (and (= |v_consumerThread1of1ForFork1_~arg#1.offset_1| |v_consumerThread1of1ForFork1_#in~arg#1.offset_1|) (= |v_consumerThread1of1ForFork1_~arg#1.base_1| |v_consumerThread1of1ForFork1_#in~arg#1.base_1|)) InVars {consumerThread1of1ForFork1_#in~arg#1.base=|v_consumerThread1of1ForFork1_#in~arg#1.base_1|, consumerThread1of1ForFork1_#in~arg#1.offset=|v_consumerThread1of1ForFork1_#in~arg#1.offset_1|} OutVars{consumerThread1of1ForFork1_#in~arg#1.base=|v_consumerThread1of1ForFork1_#in~arg#1.base_1|, consumerThread1of1ForFork1_#in~arg#1.offset=|v_consumerThread1of1ForFork1_#in~arg#1.offset_1|, consumerThread1of1ForFork1_~arg#1.base=|v_consumerThread1of1ForFork1_~arg#1.base_1|, consumerThread1of1ForFork1_~arg#1.offset=|v_consumerThread1of1ForFork1_~arg#1.offset_1|} AuxVars[] AssignedVars[consumerThread1of1ForFork1_~arg#1.base, consumerThread1of1ForFork1_~arg#1.offset] 1873#[ULTIMATE.startEXIT, L1049-2]don't care [426] L1049-2-->L1004: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2392#[L1004, ULTIMATE.startEXIT]don't care [2023-09-17 11:31:27,471 INFO L750 eck$LassoCheckResult]: Loop: 2392#[L1004, ULTIMATE.startEXIT]don't care [429] L1004-->L1007: Formula: (and (= |v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (not (= |v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= v_~lock1~0_35 1) (= (ite (= v_~lock1~0_36 0) 1 0) |v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~lock1~0=v_~lock1~0_36} OutVars{consumerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~lock1~0=v_~lock1~0_35} AuxVars[] AssignedVars[consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1, consumerThread1of1ForFork1_assume_abort_if_not_~cond#1, ~lock1~0] 2882#[L1007, ULTIMATE.startEXIT]don't care [431] L1007-->L1051: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3394#[L1051, ULTIMATE.startEXIT]don't care [434] L1051-->L1010: Formula: (<= v_~counter~0_11 0) InVars {~counter~0=v_~counter~0_11} OutVars{~counter~0=v_~counter~0_11} AuxVars[] AssignedVars[] 4124#[ULTIMATE.startEXIT, L1010]don't care [436] L1010-->L1013: Formula: (and (= |v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (= v_~lock1~0_54 1) 1 0) |v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|) (= v_~lock1~0_53 0) (not (= |v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0))) InVars {~lock1~0=v_~lock1~0_54} OutVars{consumerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_3|, consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~lock1~0=v_~lock1~0_53} AuxVars[] AssignedVars[consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1, consumerThread1of1ForFork1_assume_abort_if_not_~cond#1, ~lock1~0] 5012#[ULTIMATE.startEXIT, L1013]don't care [438] L1013-->L1049-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6140#[ULTIMATE.startEXIT, L1049-2]don't care [426] L1049-2-->L1004: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2392#[L1004, ULTIMATE.startEXIT]don't care [2023-09-17 11:31:27,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:31:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1810180224, now seen corresponding path program 1 times [2023-09-17 11:31:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:31:27,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899815198] [2023-09-17 11:31:27,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:31:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:31:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:31:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-17 11:31:27,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:31:27,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899815198] [2023-09-17 11:31:27,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899815198] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:31:27,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:31:27,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-17 11:31:27,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136877279] [2023-09-17 11:31:27,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:31:27,652 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-09-17 11:31:27,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:31:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 695907417, now seen corresponding path program 1 times [2023-09-17 11:31:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:31:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073058204] [2023-09-17 11:31:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:31:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:31:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:27,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:31:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:27,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:31:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:31:27,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-17 11:31:27,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-17 11:31:27,827 INFO L87 Difference]: Start difference. First operand null Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-09-17 11:31:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:31:29,624 INFO L93 Difference]: Finished difference Result 155553 states and 474920 transitions. [2023-09-17 11:31:29,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155553 states and 474920 transitions. [2023-09-17 11:31:31,486 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1582 [2023-09-17 11:31:32,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155553 states to 147786 states and 450933 transitions. [2023-09-17 11:31:32,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31695 [2023-09-17 11:31:33,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45533 [2023-09-17 11:31:33,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147786 states and 450933 transitions. [2023-09-17 11:31:33,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:31:33,290 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147786 states and 450933 transitions. [2023-09-17 11:31:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147786 states and 450933 transitions. [2023-09-17 11:31:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147786 to 79611. [2023-09-17 11:31:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79611 states, 79611 states have (on average 3.0690482471015312) internal successors, (244330), 79610 states have internal predecessors, (244330), 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-09-17 11:31:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79611 states to 79611 states and 244330 transitions. [2023-09-17 11:31:36,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79611 states and 244330 transitions. [2023-09-17 11:31:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-17 11:31:36,534 INFO L428 stractBuchiCegarLoop]: Abstraction has 79611 states and 244330 transitions. [2023-09-17 11:31:36,534 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:31:36,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79611 states and 244330 transitions. [2023-09-17 11:31:37,342 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 913 [2023-09-17 11:31:37,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:31:37,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:31:37,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:31:37,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:31:37,344 INFO L748 eck$LassoCheckResult]: Stem: 457582#[$Ultimate##0]don't care [329] $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] 455148#[L-1]don't care [338] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 413382#[L-1-1]don't care [372] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 413384#[L12]don't care [314] L12-->L12-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_6| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 425404#[L12-1]don't care [333] L12-1-->L12-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 425406#[L12-2]don't care [332] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 466340#[L12-3]don't care [360] L12-3-->L12-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= 9 (select |v_#length_4| 2))) InVars {#length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 466342#[L12-4]don't care [347] L12-4-->L1001: Formula: (= v_~lock1~0_7 0) InVars {} OutVars{~lock1~0=v_~lock1~0_7} AuxVars[] AssignedVars[~lock1~0] 476724#[L1001]don't care [330] L1001-->L1002: Formula: (= v_~lock2~0_7 0) InVars {} OutVars{~lock2~0=v_~lock2~0_7} AuxVars[] AssignedVars[~lock2~0] 414516#[L1002]don't care [303] L1002-->L-1-2: Formula: (= v_~counter~0_9 0) InVars {} OutVars{~counter~0=v_~counter~0_9} AuxVars[] AssignedVars[~counter~0] 414518#[L-1-2]don't care [376] 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] 416936#[L-1-3]don't care [379] L-1-3-->L1060: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_6|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t~0#1.base] 416938#[L1060]don't care [306] L1060-->L1060-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t~0#1.base_6| 1)) (= |v_ULTIMATE.start_main_~#t~0#1.offset_6| 0) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t~0#1.base_6|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_6| 0)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t~0#1.base_6| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_6|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] 422296#[L1060-1]don't care [351] L1060-1-->L1062: Formula: (= v_~counter~0_10 0) InVars {} OutVars{~counter~0=v_~counter~0_10} AuxVars[] AssignedVars[~counter~0] 422298#[L1062]don't care [309] L1062-->L1063: Formula: (= v_~lock1~0_8 0) InVars {} OutVars{~lock1~0=v_~lock1~0_8} AuxVars[] AssignedVars[~lock1~0] 444170#[L1063]don't care [307] L1063-->L1064: Formula: (= v_~lock2~0_8 0) InVars {} OutVars{~lock2~0=v_~lock2~0_8} AuxVars[] AssignedVars[~lock2~0] 444172#[L1064]don't care [373] L1064-->L1066-5: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 415206#[L1066-5]don't care [385] L1066-5-->L1066: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 415208#[L1066]don't care [390] L1066-->L1066-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 435096#[L1066-1]don't care [358] L1066-1-->L1066-4: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| 0) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[] 435100#[L1066-4]don't care [318] L1066-4-->L1069: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 436172#[L1069]don't care [304] L1069-->L1069-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 436174#[L1069-1]don't care [348] L1069-1-->L1069-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 454158#[L1069-2]don't care [302] L1069-2-->L1069-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_2| 4) (select |v_#length_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_2|) |v_ULTIMATE.start_main_~#t~0#1.offset_2| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_3|) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_2|) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 1)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, #length=|v_#length_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, #length=|v_#length_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|} AuxVars[] AssignedVars[#memory_int] 454160#[L1069-3]don't care [454] L1069-3-->$Ultimate##0: Formula: (and (= v_consumerThread1of1ForFork1_thidvar1_2 0) (= |v_consumerThread1of1ForFork1_#in~arg#1.base_4| 0) (= v_consumerThread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= |v_consumerThread1of1ForFork1_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_8|, consumerThread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_consumerThread1of1ForFork1___VERIFIER_assert_#in~cond#1_6|, consumerThread1of1ForFork1_~arg#1.base=|v_consumerThread1of1ForFork1_~arg#1.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, consumerThread1of1ForFork1_~arg#1.offset=|v_consumerThread1of1ForFork1_~arg#1.offset_4|, consumerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_8|, consumerThread1of1ForFork1___VERIFIER_assert_~cond#1=|v_consumerThread1of1ForFork1___VERIFIER_assert_~cond#1_10|, consumerThread1of1ForFork1_#res#1.base=|v_consumerThread1of1ForFork1_#res#1.base_4|, consumerThread1of1ForFork1_thidvar1=v_consumerThread1of1ForFork1_thidvar1_2, consumerThread1of1ForFork1_thidvar0=v_consumerThread1of1ForFork1_thidvar0_2, consumerThread1of1ForFork1_#res#1.offset=|v_consumerThread1of1ForFork1_#res#1.offset_4|, consumerThread1of1ForFork1_#in~arg#1.offset=|v_consumerThread1of1ForFork1_#in~arg#1.offset_4|, consumerThread1of1ForFork1_#t~post7#1=|v_consumerThread1of1ForFork1_#t~post7#1_8|, consumerThread1of1ForFork1_#in~arg#1.base=|v_consumerThread1of1ForFork1_#in~arg#1.base_4|} AuxVars[] AssignedVars[consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1, consumerThread1of1ForFork1___VERIFIER_assert_#in~cond#1, consumerThread1of1ForFork1_~arg#1.base, consumerThread1of1ForFork1_~arg#1.offset, consumerThread1of1ForFork1_assume_abort_if_not_~cond#1, consumerThread1of1ForFork1___VERIFIER_assert_~cond#1, consumerThread1of1ForFork1_#res#1.base, consumerThread1of1ForFork1_thidvar1, consumerThread1of1ForFork1_thidvar0, consumerThread1of1ForFork1_#res#1.offset, consumerThread1of1ForFork1_#in~arg#1.offset, consumerThread1of1ForFork1_#t~post7#1, consumerThread1of1ForFork1_#in~arg#1.base] 457718#[$Ultimate##0, L1069-4]don't care [325] L1069-4-->L1069-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 408624#[$Ultimate##0, L1069-5]don't care [363] L1069-5-->L1066-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 408628#[$Ultimate##0, L1066-5]don't care [385] L1066-5-->L1066: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 470492#[$Ultimate##0, L1066]don't care [390] L1066-->L1066-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 478098#[$Ultimate##0, L1066-1]don't care [358] L1066-1-->L1066-4: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| 0) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[] 482010#[$Ultimate##0, L1066-4]don't care [318] L1066-4-->L1069: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 484644#[$Ultimate##0, L1069]don't care [304] L1069-->L1069-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 428376#[$Ultimate##0, L1069-1]don't care [348] L1069-1-->L1069-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 428378#[$Ultimate##0, L1069-2]don't care [302] L1069-2-->L1069-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t~0#1.offset_2| 4) (select |v_#length_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_2|) |v_ULTIMATE.start_main_~#t~0#1.offset_2| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_3|) (<= 0 |v_ULTIMATE.start_main_~#t~0#1.offset_2|) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 1)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, #length=|v_#length_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, #length=|v_#length_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|} AuxVars[] AssignedVars[#memory_int] 420132#[$Ultimate##0, L1069-3]don't care [452] L1069-3-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 420134#[$Ultimate##0, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [425] $Ultimate##0-->L1049-2: Formula: (and (= |v_consumerThread1of1ForFork1_~arg#1.offset_1| |v_consumerThread1of1ForFork1_#in~arg#1.offset_1|) (= |v_consumerThread1of1ForFork1_~arg#1.base_1| |v_consumerThread1of1ForFork1_#in~arg#1.base_1|)) InVars {consumerThread1of1ForFork1_#in~arg#1.base=|v_consumerThread1of1ForFork1_#in~arg#1.base_1|, consumerThread1of1ForFork1_#in~arg#1.offset=|v_consumerThread1of1ForFork1_#in~arg#1.offset_1|} OutVars{consumerThread1of1ForFork1_#in~arg#1.base=|v_consumerThread1of1ForFork1_#in~arg#1.base_1|, consumerThread1of1ForFork1_#in~arg#1.offset=|v_consumerThread1of1ForFork1_#in~arg#1.offset_1|, consumerThread1of1ForFork1_~arg#1.base=|v_consumerThread1of1ForFork1_~arg#1.base_1|, consumerThread1of1ForFork1_~arg#1.offset=|v_consumerThread1of1ForFork1_~arg#1.offset_1|} AuxVars[] AssignedVars[consumerThread1of1ForFork1_~arg#1.base, consumerThread1of1ForFork1_~arg#1.offset] 481510#[L1049-2, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-09-17 11:31:37,346 INFO L750 eck$LassoCheckResult]: Loop: 481510#[L1049-2, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [426] L1049-2-->L1004: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 412038#[L1004, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [429] L1004-->L1007: Formula: (and (= |v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (not (= |v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= v_~lock1~0_35 1) (= (ite (= v_~lock1~0_36 0) 1 0) |v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|)) InVars {~lock1~0=v_~lock1~0_36} OutVars{consumerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_1|, consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~lock1~0=v_~lock1~0_35} AuxVars[] AssignedVars[consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1, consumerThread1of1ForFork1_assume_abort_if_not_~cond#1, ~lock1~0] 412042#[L1007, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [431] L1007-->L1051: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 419500#[L1051, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [434] L1051-->L1010: Formula: (<= v_~counter~0_11 0) InVars {~counter~0=v_~counter~0_11} OutVars{~counter~0=v_~counter~0_11} AuxVars[] AssignedVars[] 419496#[L1010, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [436] L1010-->L1013: Formula: (and (= |v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (= v_~lock1~0_54 1) 1 0) |v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|) (= v_~lock1~0_53 0) (not (= |v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0))) InVars {~lock1~0=v_~lock1~0_54} OutVars{consumerThread1of1ForFork1_assume_abort_if_not_~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_~cond#1_3|, consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~lock1~0=v_~lock1~0_53} AuxVars[] AssignedVars[consumerThread1of1ForFork1_assume_abort_if_not_#in~cond#1, consumerThread1of1ForFork1_assume_abort_if_not_~cond#1, ~lock1~0] 426706#[L1013, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [453] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 426702#[L1013, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [438] L1013-->L1049-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 481510#[L1049-2, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-09-17 11:31:37,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:31:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1719119357, now seen corresponding path program 1 times [2023-09-17 11:31:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:31:37,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600868582] [2023-09-17 11:31:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:31:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:31:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:37,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:31:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:37,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:31:37,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:31:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1670660606, now seen corresponding path program 1 times [2023-09-17 11:31:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:31:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967078639] [2023-09-17 11:31:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:31:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:31:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:37,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:31:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:37,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:31:37,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:31:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1898842556, now seen corresponding path program 1 times [2023-09-17 11:31:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:31:37,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592468611] [2023-09-17 11:31:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:31:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:31:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:37,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:31:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:37,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:31:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:37,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:31:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:31:37,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:31:37 BoogieIcfgContainer [2023-09-17 11:31:37,989 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:31:37,990 INFO L158 Benchmark]: Toolchain (without parser) took 20336.54ms. Allocated memory was 194.0MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 147.0MB in the beginning and 5.3GB in the end (delta: -5.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-09-17 11:31:37,990 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:31:37,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.82ms. Allocated memory is still 194.0MB. Free memory was 146.7MB in the beginning and 118.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-09-17 11:31:37,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.10ms. Allocated memory is still 194.0MB. Free memory was 118.4MB in the beginning and 115.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-09-17 11:31:37,991 INFO L158 Benchmark]: Boogie Preprocessor took 32.16ms. Allocated memory is still 194.0MB. Free memory was 115.6MB in the beginning and 114.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:31:37,992 INFO L158 Benchmark]: RCFGBuilder took 462.52ms. Allocated memory is still 194.0MB. Free memory was 113.8MB in the beginning and 150.6MB in the end (delta: -36.8MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2023-09-17 11:31:37,992 INFO L158 Benchmark]: BuchiAutomizer took 19337.49ms. Allocated memory was 194.0MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 150.6MB in the beginning and 5.3GB in the end (delta: -5.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-09-17 11:31:37,994 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.14ms. Allocated memory is still 194.0MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 453.82ms. Allocated memory is still 194.0MB. Free memory was 146.7MB in the beginning and 118.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.10ms. Allocated memory is still 194.0MB. Free memory was 118.4MB in the beginning and 115.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.16ms. Allocated memory is still 194.0MB. Free memory was 115.6MB in the beginning and 114.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 462.52ms. Allocated memory is still 194.0MB. Free memory was 113.8MB in the beginning and 150.6MB in the end (delta: -36.8MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 19337.49ms. Allocated memory was 194.0MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 150.6MB in the beginning and 5.3GB in the end (delta: -5.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 2 locations. The remainder module has 79611 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.2s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 8.7s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 3.2s AutomataMinimizationTime, 1 MinimizatonAttempts, 68175 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 3.2s Buchi closure took 0.1s. 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, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 79 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 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: 1049]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L1000] 0 volatile int lock1; VAL [lock1=0] [L1001] 0 volatile int lock2; VAL [lock1=0, lock2=0] [L1002] 0 volatile int counter; VAL [counter=0, lock1=0, lock2=0] [L1060] 0 pthread_t t; VAL [counter=0, lock1=0, lock2=0, t={26981:0}] [L1061] 0 counter = 0 VAL [counter=0, lock1=0, lock2=0, t={26981:0}] [L1062] 0 lock1 = 0 VAL [counter=0, lock1=0, lock2=0, t={26981:0}] [L1063] 0 lock2 = 0 VAL [counter=0, lock1=0, lock2=0, t={26981:0}] [L1064] 0 int i =0; VAL [counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1065] COND TRUE 0 1 VAL [counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1066] COND FALSE 0 !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1069] FCALL, FORK 0 pthread_create(&t, 0, consumer, 0) VAL [counter=0, i=0, lock1=0, lock2=0, pthread_create(&t, 0, consumer, 0)=17977, t={26981:0}] [L1065] COND TRUE 0 1 VAL [counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1066] COND FALSE 0 !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1069] FCALL, FORK 0 pthread_create(&t, 0, consumer, 0) VAL [counter=0, i=0, lock1=0, lock2=0, pthread_create(&t, 0, consumer, 0)=17978, t={26981:0}] Loop: [L1049] COND TRUE 1 [L1050] CALL acquire1() [L1005] CALL assume_abort_if_not(lock1 == 0) [L16] COND TRUE !cond [L1005] RET assume_abort_if_not(lock1 == 0) [L1006] lock1 = 1 [L1050] RET acquire1() [L1051] COND FALSE !(counter > 0) [L1052] CALL release1() [L1011] CALL assume_abort_if_not(lock1 == 1) [L16] COND FALSE !(!cond) [L1011] RET assume_abort_if_not(lock1 == 1) [L1012] lock1 = 0 [L1052] RET release1() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1049]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L1000] 0 volatile int lock1; VAL [lock1=0] [L1001] 0 volatile int lock2; VAL [lock1=0, lock2=0] [L1002] 0 volatile int counter; VAL [counter=0, lock1=0, lock2=0] [L1060] 0 pthread_t t; VAL [counter=0, lock1=0, lock2=0, t={26981:0}] [L1061] 0 counter = 0 VAL [counter=0, lock1=0, lock2=0, t={26981:0}] [L1062] 0 lock1 = 0 VAL [counter=0, lock1=0, lock2=0, t={26981:0}] [L1063] 0 lock2 = 0 VAL [counter=0, lock1=0, lock2=0, t={26981:0}] [L1064] 0 int i =0; VAL [counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1065] COND TRUE 0 1 VAL [counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1066] COND FALSE 0 !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1069] FCALL, FORK 0 pthread_create(&t, 0, consumer, 0) VAL [counter=0, i=0, lock1=0, lock2=0, pthread_create(&t, 0, consumer, 0)=17977, t={26981:0}] [L1065] COND TRUE 0 1 VAL [counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1066] COND FALSE 0 !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, counter=0, i=0, lock1=0, lock2=0, t={26981:0}] [L1069] FCALL, FORK 0 pthread_create(&t, 0, consumer, 0) VAL [counter=0, i=0, lock1=0, lock2=0, pthread_create(&t, 0, consumer, 0)=17978, t={26981:0}] Loop: [L1049] COND TRUE 1 [L1050] CALL acquire1() [L1005] CALL assume_abort_if_not(lock1 == 0) [L16] COND TRUE !cond [L1005] RET assume_abort_if_not(lock1 == 0) [L1006] lock1 = 1 [L1050] RET acquire1() [L1051] COND FALSE !(counter > 0) [L1052] CALL release1() [L1011] CALL assume_abort_if_not(lock1 == 1) [L16] COND FALSE !(!cond) [L1011] RET assume_abort_if_not(lock1 == 1) [L1012] lock1 = 0 [L1052] RET release1() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-09-17 11:31:38,041 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...