/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/weaver/spaghetti.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:26:44,501 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:26:44,567 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:26:44,586 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:26:44,586 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:26:44,587 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:26:44,588 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:26:44,588 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:26:44,588 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:26:44,588 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:26:44,589 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:26:44,589 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:26:44,589 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:26:44,589 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:26:44,589 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:26:44,590 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:26:44,590 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:26:44,590 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:26:44,590 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:26:44,591 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:26:44,591 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:26:44,591 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:26:44,592 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:26:44,592 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:26:44,592 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:26:44,592 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:26:44,592 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:26:44,593 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:26:44,593 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:26:44,593 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:26:44,593 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:26:44,594 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:26:44,594 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:26:44,594 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:26:44,595 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:26:44,595 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-09-17 11:26:44,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:26:44,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:26:44,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:26:44,799 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:26:44,800 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:26:44,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/spaghetti.wvr.c [2023-09-17 11:26:45,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:26:46,014 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:26:46,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c [2023-09-17 11:26:46,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445ccb791/8f2d269b06db4c8ca7e9a05457b1a5a3/FLAGbd24c6cb4 [2023-09-17 11:26:46,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445ccb791/8f2d269b06db4c8ca7e9a05457b1a5a3 [2023-09-17 11:26:46,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:26:46,035 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:26:46,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:26:46,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:26:46,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:26:46,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65717a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46, skipping insertion in model container [2023-09-17 11:26:46,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:26:46,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:26:46,194 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c[3129,3142] [2023-09-17 11:26:46,195 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:26:46,205 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:26:46,218 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c[3129,3142] [2023-09-17 11:26:46,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:26:46,223 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:26:46,223 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:26:46,229 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:26:46,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46 WrapperNode [2023-09-17 11:26:46,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:26:46,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:26:46,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:26:46,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:26:46,237 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:26:46" (1/1) ... [2023-09-17 11:26:46,248 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:26:46" (1/1) ... [2023-09-17 11:26:46,262 INFO L138 Inliner]: procedures = 23, calls = 55, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2023-09-17 11:26:46,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:26:46,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:26:46,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:26:46,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:26:46,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:26:46,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:26:46,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:26:46,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:26:46,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (1/1) ... [2023-09-17 11:26:46,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:26:46,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:26:46,320 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:26:46,322 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:26:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:26:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 11:26:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 11:26:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 11:26:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 11:26:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-17 11:26:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-17 11:26:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-17 11:26:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-17 11:26:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:26:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:26:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:26:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:26:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:26:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:26:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:26:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:26:46,356 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:26:46,438 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:26:46,440 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:26:46,602 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:26:46,617 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:26:46,617 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-17 11:26:46,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:26:46 BoogieIcfgContainer [2023-09-17 11:26:46,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:26:46,619 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:26:46,619 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:26:46,622 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:26:46,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:26:46,622 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:26:46" (1/3) ... [2023-09-17 11:26:46,623 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33771db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:26:46, skipping insertion in model container [2023-09-17 11:26:46,623 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:26:46,623 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:26:46" (2/3) ... [2023-09-17 11:26:46,623 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33771db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:26:46, skipping insertion in model container [2023-09-17 11:26:46,623 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:26:46,623 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:26:46" (3/3) ... [2023-09-17 11:26:46,624 INFO L332 chiAutomizerObserver]: Analyzing ICFG spaghetti.wvr.c [2023-09-17 11:26:46,723 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:26:46,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 117 transitions, 254 flow [2023-09-17 11:26:46,783 INFO L124 PetriNetUnfolderBase]: 9/109 cut-off events. [2023-09-17 11:26:46,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:26:46,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 9/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 126 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-09-17 11:26:46,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 117 transitions, 254 flow [2023-09-17 11:26:46,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 109 transitions, 230 flow [2023-09-17 11:26:46,828 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:26:46,828 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:26:46,828 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:26:46,828 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:26:46,828 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:26:46,828 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:26:46,828 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:26:46,829 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:26:46,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-17 11:27:03,317 INFO L131 ngComponentsAnalysis]: Automaton has 14038 accepting balls. 236556 [2023-09-17 11:27:03,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:27:03,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:27:03,328 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] [2023-09-17 11:27:03,328 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-17 11:27:03,328 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:27:03,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 250010 states, but on-demand construction may add more states [2023-09-17 11:27:09,390 INFO L131 ngComponentsAnalysis]: Automaton has 14038 accepting balls. 236556 [2023-09-17 11:27:09,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:27:09,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:27:09,396 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] [2023-09-17 11:27:09,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-17 11:27:09,401 INFO L748 eck$LassoCheckResult]: Stem: 120#[$Ultimate##0]don't care [177] $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] 123#[L-1]don't care [186] L-1-->L-1-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 125#[L-1-1]don't care [253] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 127#[L21]don't care [237] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 129#[L21-1]don't care [246] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 131#[L21-2]don't care [193] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 133#[L21-3]don't care [226] L21-3-->L21-4: Formula: (and (= 16 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 135#[L21-4]don't care [213] L21-4-->L38: Formula: (= v_~x_0~0_12 0) InVars {} OutVars{~x_0~0=v_~x_0~0_12} AuxVars[] AssignedVars[~x_0~0] 137#[L38]don't care [214] L38-->L-1-2: Formula: (= v_~x_1~0_7 0) InVars {} OutVars{~x_1~0=v_~x_1~0_7} AuxVars[] AssignedVars[~x_1~0] 139#[L-1-2]don't care [256] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 141#[L-1-3]don't care [260] L-1-3-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_~#t2~0#1.base] 143#[L112]don't care [197] L112-->L112-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 145#[L112-1]don't care [215] L112-1-->L112-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 147#[L112-2]don't care [252] L112-2-->L112-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 149#[L112-3]don't care [161] L112-3-->L112-4: Formula: (and (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_3| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_3| 4) |v_#length_9|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_3| 1)) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_3|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_3| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 151#[L112-4]don't care [212] L112-4-->L114: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 153#[L114]don't care [198] L114-->L114-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~x_0~0_13) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~x_0~0=v_~x_0~0_13, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~x_0~0] 155#[L114-1]don't care [235] L114-1-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 157#[L115]don't care [201] L115-->L115-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 159#[L115-1]don't care [204] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~x_1~0_8) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~x_1~0=v_~x_1~0_8} AuxVars[] AssignedVars[~x_1~0] 161#[L115-2]don't care [205] L115-2-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 163#[L117]don't care [160] L117-->L117-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 165#[L117-1]don't care [236] L117-1-->L117-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 167#[L117-2]don't care [167] L117-2-->L117-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 169#[L117-3]don't care [315] L117-3-->L51: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork1_#t~nondet2=|v_thread1Thread1of1ForFork1_#t~nondet2_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~nondet1=|v_thread1Thread1of1ForFork1_#t~nondet1_12|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet2, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~nondet1, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 171#[L51, L117-4]don't care [2023-09-17 11:27:09,401 INFO L750 eck$LassoCheckResult]: Loop: 171#[L51, L117-4]don't care [264] L51-->L42: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1=|v_thread1Thread1of1ForFork1_#t~nondet1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1] 173#[L42, L117-4]don't care [267] L42-->L42-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1_5| 256) 0)) InVars {thread1Thread1of1ForFork1_#t~nondet1=|v_thread1Thread1of1ForFork1_#t~nondet1_5|} OutVars{thread1Thread1of1ForFork1_#t~nondet1=|v_thread1Thread1of1ForFork1_#t~nondet1_5|} AuxVars[] AssignedVars[] 181#[L42-3, L117-4]don't care [270] L42-3-->L43: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~nondet1=|v_thread1Thread1of1ForFork1_#t~nondet1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet1] 195#[L43, L117-4]don't care [272] L43-->L45: Formula: true InVars {} OutVars{~x_0~0=v_~x_0~0_17, thread1Thread1of1ForFork1_#t~nondet2=|v_thread1Thread1of1ForFork1_#t~nondet2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet2, ~x_0~0] 213#[L45, L117-4]don't care [274] L45-->L48: Formula: (= v_~x_0~0_2 (+ 3 v_~x_0~0_3)) InVars {~x_0~0=v_~x_0~0_3} OutVars{~x_0~0=v_~x_0~0_2} AuxVars[] AssignedVars[~x_0~0] 235#[L48, L117-4]don't care [275] L48-->L51: Formula: (= (* 2 v_~x_0~0_5) v_~x_0~0_4) InVars {~x_0~0=v_~x_0~0_5} OutVars{~x_0~0=v_~x_0~0_4} AuxVars[] AssignedVars[~x_0~0] 171#[L51, L117-4]don't care [2023-09-17 11:27:09,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:27:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash 369473642, now seen corresponding path program 1 times [2023-09-17 11:27:09,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:27:09,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5654037] [2023-09-17 11:27:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:27:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:27:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:27:09,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:27:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:27:09,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:27:09,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:27:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 110558791, now seen corresponding path program 1 times [2023-09-17 11:27:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:27:09,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326517902] [2023-09-17 11:27:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:27:09,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:27:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:27:09,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:27:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:27:09,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:27:09,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:27:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash -236911632, now seen corresponding path program 1 times [2023-09-17 11:27:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:27:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260843652] [2023-09-17 11:27:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:27:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:27:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:27:09,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:27:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:27:09,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:27:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:27:10,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:27:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:27:10,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:27:10 BoogieIcfgContainer [2023-09-17 11:27:10,489 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:27:10,491 INFO L158 Benchmark]: Toolchain (without parser) took 24454.57ms. Allocated memory was 169.9MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 125.7MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-09-17 11:27:10,491 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:27:10,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.52ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 114.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-09-17 11:27:10,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.74ms. Allocated memory is still 169.9MB. Free memory was 114.2MB in the beginning and 112.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:27:10,492 INFO L158 Benchmark]: Boogie Preprocessor took 22.44ms. Allocated memory is still 169.9MB. Free memory was 112.7MB in the beginning and 111.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 11:27:10,492 INFO L158 Benchmark]: RCFGBuilder took 332.45ms. Allocated memory is still 169.9MB. Free memory was 111.5MB in the beginning and 96.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-09-17 11:27:10,493 INFO L158 Benchmark]: BuchiAutomizer took 23869.73ms. Allocated memory was 169.9MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 96.4MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-09-17 11:27:10,495 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.09ms. Allocated memory is still 169.9MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.52ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 114.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.74ms. Allocated memory is still 169.9MB. Free memory was 114.2MB in the beginning and 112.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.44ms. Allocated memory is still 169.9MB. Free memory was 112.7MB in the beginning and 111.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 332.45ms. Allocated memory is still 169.9MB. Free memory was 111.5MB in the beginning and 96.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 23869.73ms. Allocated memory was 169.9MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 96.4MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.7s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 42]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L38] 0 unsigned int x_0, x_1; VAL [x_0=0, x_1=0] [L112] 0 pthread_t t1, t2, t3, t4; VAL [t1={17234:0}, t2={17237:0}, t3={17235:0}, t4={17236:0}, x_0=0, x_1=0] [L114] 0 x_0 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, t1={17234:0}, t2={17237:0}, t3={17235:0}, t4={17236:0}, x_0=0, x_1=0] [L115] 0 x_1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=11, t1={17234:0}, t2={17237:0}, t3={17235:0}, t4={17236:0}, x_0=0, x_1=11] [L117] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [pthread_create(&t1, 0, thread1, 0)=-1, t1={17234:0}, t2={17237:0}, t3={17235:0}, t4={17236:0}, x_0=0, x_1=11] Loop: [L42] COND TRUE __VERIFIER_nondet_bool() [L44] x_0 = __VERIFIER_nondet_uint() [L47] x_0 = x_0 + 3 [L50] x_0 = 2 * x_0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L38] 0 unsigned int x_0, x_1; VAL [x_0=0, x_1=0] [L112] 0 pthread_t t1, t2, t3, t4; VAL [t1={17234:0}, t2={17237:0}, t3={17235:0}, t4={17236:0}, x_0=0, x_1=0] [L114] 0 x_0 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, t1={17234:0}, t2={17237:0}, t3={17235:0}, t4={17236:0}, x_0=0, x_1=0] [L115] 0 x_1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=11, t1={17234:0}, t2={17237:0}, t3={17235:0}, t4={17236:0}, x_0=0, x_1=11] [L117] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [pthread_create(&t1, 0, thread1, 0)=-1, t1={17234:0}, t2={17237:0}, t3={17235:0}, t4={17236:0}, x_0=0, x_1=11] Loop: [L42] COND TRUE __VERIFIER_nondet_bool() [L44] x_0 = __VERIFIER_nondet_uint() [L47] x_0 = x_0 + 3 [L50] x_0 = 2 * x_0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-09-17 11:27:10,524 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...