/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/weaver/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:44:48,140 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:44:48,176 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:44:48,193 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:44:48,193 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:44:48,194 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:44:48,194 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:44:48,195 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:44:48,195 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:44:48,198 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:44:48,198 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:44:48,198 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:44:48,198 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:44:48,199 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:44:48,200 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:44:48,200 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:44:48,200 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:44:48,200 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:44:48,200 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:44:48,201 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:44:48,201 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:44:48,201 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:44:48,201 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:44:48,201 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:44:48,201 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:44:48,202 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:44:48,202 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:44:48,202 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:44:48,202 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:44:48,202 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:44:48,203 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:44:48,203 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:44:48,203 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:44:48,203 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:44:48,204 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:44:48,204 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:44:48,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:44:48,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:44:48,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:44:48,430 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:44:48,432 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:44:48,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2023-09-17 11:44:49,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:44:49,709 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:44:49,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2023-09-17 11:44:49,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62c15a18a/2ddd41c0d32a47ddb6899decbcc58c0a/FLAG08824bb79 [2023-09-17 11:44:49,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62c15a18a/2ddd41c0d32a47ddb6899decbcc58c0a [2023-09-17 11:44:49,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:44:49,728 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:44:49,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:44:49,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:44:49,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:44:49,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b36927f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49, skipping insertion in model container [2023-09-17 11:44:49,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:44:49,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:44:49,874 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/test-easy11.wvr.c[1959,1972] [2023-09-17 11:44:49,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:44:49,885 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:44:49,899 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/test-easy11.wvr.c[1959,1972] [2023-09-17 11:44:49,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:44:49,904 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:44:49,904 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:44:49,909 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:44:49,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49 WrapperNode [2023-09-17 11:44:49,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:44:49,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:44:49,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:44:49,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:44:49,915 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:44:49" (1/1) ... [2023-09-17 11:44:49,920 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:44:49" (1/1) ... [2023-09-17 11:44:49,931 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2023-09-17 11:44:49,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:44:49,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:44:49,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:44:49,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:44:49,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:44:49,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:44:49,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:44:49,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:44:49,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (1/1) ... [2023-09-17 11:44:49,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:44:49,975 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:44:49,977 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:44:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:44:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 11:44:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 11:44:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 11:44:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 11:44:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:44:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:44:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:44:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:44:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:44:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:44:49,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:44:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:44:50,000 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:44:50,061 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:44:50,062 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:44:50,193 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:44:50,198 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:44:50,198 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-17 11:44:50,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:44:50 BoogieIcfgContainer [2023-09-17 11:44:50,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:44:50,200 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:44:50,200 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:44:50,203 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:44:50,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:44:50,203 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:44:49" (1/3) ... [2023-09-17 11:44:50,204 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aa1043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:44:50, skipping insertion in model container [2023-09-17 11:44:50,204 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:44:50,204 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:44:49" (2/3) ... [2023-09-17 11:44:50,204 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aa1043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:44:50, skipping insertion in model container [2023-09-17 11:44:50,204 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:44:50,205 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:44:50" (3/3) ... [2023-09-17 11:44:50,205 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-easy11.wvr.c [2023-09-17 11:44:50,252 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:44:50,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 74 transitions, 158 flow [2023-09-17 11:44:50,294 INFO L124 PetriNetUnfolderBase]: 6/70 cut-off events. [2023-09-17 11:44:50,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:44:50,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 70 events. 6/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-09-17 11:44:50,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 74 transitions, 158 flow [2023-09-17 11:44:50,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 146 flow [2023-09-17 11:44:50,313 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:44:50,313 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:44:50,313 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:44:50,313 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:44:50,313 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:44:50,313 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:44:50,313 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:44:50,313 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:44:50,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 11:44:50,932 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 104 [2023-09-17 11:44:50,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:44:50,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:44:50,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:44:50,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:44:50,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:44:50,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 11:44:51,260 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 104 [2023-09-17 11:44:51,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:44:51,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:44:51,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:44:51,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:44:51,278 INFO L748 eck$LassoCheckResult]: Stem: 83#[$Ultimate##0]don't care [126] $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] 88#[L-1]don't care [133] L-1-->L-1-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[] 92#[L-1-1]don't care [154] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 95#[L21]don't care [125] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_8| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] 98#[L21-1]don't care [147] L21-1-->L21-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[] 101#[L21-2]don't care [144] L21-2-->L21-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[] 104#[L21-3]don't care [111] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_4| 2) 18)) InVars {#length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[] 107#[L21-4]don't care [162] L21-4-->L38: Formula: (= v_~X~0_3 0) InVars {} OutVars{~X~0=v_~X~0_3} AuxVars[] AssignedVars[~X~0] 110#[L38]don't care [163] L38-->L-1-2: Formula: (= v_~Y~0_6 0) InVars {} OutVars{~Y~0=v_~Y~0_6} AuxVars[] AssignedVars[~Y~0] 113#[L-1-2]don't care [155] 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] 116#[L-1-3]don't care [158] L-1-3-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 119#[L67]don't care [151] L67-->L67-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_10|) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_5|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 122#[L67-1]don't care [120] L67-1-->L67-2: Formula: (and (= (store |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_12|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_7|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 125#[L67-2]don't care [107] L67-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 128#[L69]don't care [108] L69-->L69-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~X~0_4) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~X~0=v_~X~0_4} AuxVars[] AssignedVars[~X~0] 131#[L69-1]don't care [156] L69-1-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] 134#[L70]don't care [164] L70-->L70-1: Formula: (= (ite (<= v_~X~0_5 10000) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~X~0=v_~X~0_5} OutVars{~X~0=v_~X~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 137#[L70-1]don't care [122] L70-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 140#[L34]don't care [123] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 143#[L35]don't care [149] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 149#[L34-1]don't care [142] L34-1-->L73: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 152#[L73]don't care [130] L73-->L73-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 155#[L73-1]don't care [141] L73-1-->L73-2: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre4#1_2|)) |v_#memory_int_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1)) InVars {#valid=|v_#valid_1|, #memory_int=|v_#memory_int_2|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{#valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 158#[L73-2]don't care [192] L73-2-->$Ultimate##0: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_16, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 164#[L73-3, $Ultimate##0]don't care [160] L73-3-->L73-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 171#[$Ultimate##0, L73-4]don't care [132] L73-4-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 181#[L74, $Ultimate##0]don't care [101] L74-->L74-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 195#[$Ultimate##0, L74-1]don't care [168] $Ultimate##0-->L42: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0] 216#[L74-1, L42]don't care [127] L74-1-->L74-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 252#[L74-2, L42]don't care [134] L74-2-->L74-3: Formula: (and (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre6#1_2|)))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 316#[L42, L74-3]don't care [195] L74-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_8|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_16, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 407#[$Ultimate##0, L74-4, L42]don't care [104] L74-4-->L74-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 530#[$Ultimate##0, L74-5, L42]don't care [161] L74-5-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 674#[$Ultimate##0, L76, L42]don't care [165] L76-->L76-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= 20000 v_~Y~0_5)) 1 0)) InVars {~Y~0=v_~Y~0_5} OutVars{~Y~0=v_~Y~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 856#[$Ultimate##0, L76-1, L42]don't care [146] L76-1-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1102#[$Ultimate##0, L42, L34-2]don't care [136] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1510#[$Ultimate##0, L42, L35-3]don't care [169] L42-->L43-2: Formula: (= v_thread1Thread1of1ForFork0_~x~0_3 v_~X~0_1) InVars {~X~0=v_~X~0_1} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_3, ~X~0=v_~X~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0] 2129#[L43-2, $Ultimate##0, L35-3]don't care [106] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[] 2988#[L43-2, $Ultimate##0, L34-3]don't care [110] L34-3-->L79: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] 4095#[L43-2, $Ultimate##0, L79]don't care [152] L79-->L67-3: 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] 5406#[L43-2, $Ultimate##0, L67-3]don't care [109] L67-3-->L67-4: Formula: (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0) |v_#valid_3|) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid] 6858#[L43-2, $Ultimate##0, L67-4]don't care [150] L67-4-->L67-5: Formula: true InVars {} OutVars{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[ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 8405#[L43-2, $Ultimate##0, L67-5]don't care [103] L67-5-->L67-6: Formula: (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) InVars {ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid] 10003#[L43-2, $Ultimate##0, L67-6]don't care [112] L67-6-->main_returnLabel#1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 11618#[L43-2, $Ultimate##0, main_returnLabel#1]don't care [157] main_returnLabel#1-->ULTIMATE.startFINAL: Formula: (= |v_ULTIMATE.start_main_#res#1_2| |v_ULTIMATE.start_#t~ret8#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~ret8#1=|v_ULTIMATE.start_#t~ret8#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret8#1] 13200#[L43-2, $Ultimate##0, ULTIMATE.startFINAL]don't care [167] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14701#[L43-2, $Ultimate##0, ULTIMATE.startEXIT]don't care [179] $Ultimate##0-->L55: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] 16134#[L43-2, ULTIMATE.startEXIT, L55]don't care [180] L55-->L56-2: Formula: (= v_thread2Thread1of1ForFork1_~x~1_3 v_~X~0_2) InVars {~X~0=v_~X~0_2} OutVars{~X~0=v_~X~0_2, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] 17462#[L43-2, ULTIMATE.startEXIT, L56-2]don't care [2023-09-17 11:44:51,280 INFO L750 eck$LassoCheckResult]: Loop: 17462#[L43-2, ULTIMATE.startEXIT, L56-2]don't care [170] L43-2-->L44: Formula: (< v_thread1Thread1of1ForFork0_~x~0_5 10000) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_5} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_5} AuxVars[] AssignedVars[] 18475#[ULTIMATE.startEXIT, L44, L56-2]don't care [181] L56-2-->L57: Formula: (< v_thread2Thread1of1ForFork1_~x~1_5 10000) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_5} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_5} AuxVars[] AssignedVars[] 19604#[L57, ULTIMATE.startEXIT, L44]don't care [173] L44-->L44-1: Formula: (= v_thread1Thread1of1ForFork0_~x~0_9 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_9} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_9, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 20563#[L57, ULTIMATE.startEXIT, L44-1]don't care [184] L57-->L57-1: Formula: (= |v_thread2Thread1of1ForFork1_#t~post2_1| v_thread2Thread1of1ForFork1_~x~1_9) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_9} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_1|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 20811#[ULTIMATE.startEXIT, L44-1, L57-1]don't care [175] L44-1-->L44-2: Formula: (= v_thread1Thread1of1ForFork0_~x~0_13 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_13, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0] 21384#[ULTIMATE.startEXIT, L57-1, L44-2]don't care [177] L44-2-->L43-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 19786#[L43-2, ULTIMATE.startEXIT, L57-1]don't care [186] L57-1-->L57-2: Formula: (= v_thread2Thread1of1ForFork1_~x~1_13 (+ |v_thread2Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_13} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] 20587#[L43-2, ULTIMATE.startEXIT, L57-2]don't care [188] L57-2-->L56-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 17462#[L43-2, ULTIMATE.startEXIT, L56-2]don't care [2023-09-17 11:44:51,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:44:51,285 INFO L85 PathProgramCache]: Analyzing trace with hash -139264005, now seen corresponding path program 1 times [2023-09-17 11:44:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:44:51,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314662802] [2023-09-17 11:44:51,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:44:51,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:44:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:44:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:44:51,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:44:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314662802] [2023-09-17 11:44:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314662802] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:44:51,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:44:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-17 11:44:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092974735] [2023-09-17 11:44:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:44:51,485 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-09-17 11:44:51,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:44:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 675128539, now seen corresponding path program 1 times [2023-09-17 11:44:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:44:51,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563772902] [2023-09-17 11:44:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:44:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:44:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:44:51,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:44:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:44:51,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:44:51,572 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:44:51,573 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:44:51,573 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:44:51,573 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:44:51,574 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-09-17 11:44:51,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:51,575 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:44:51,575 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:44:51,575 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration1_Loop [2023-09-17 11:44:51,576 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:44:51,576 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:44:51,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,696 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:44:51,697 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-09-17 11:44:51,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:44:51,712 INFO L229 MonitoredProcess]: Starting monitored process 2 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:44:51,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-09-17 11:44:51,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-17 11:44:51,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 11:44:51,735 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-09-17 11:44:51,736 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-09-17 11:44:51,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-09-17 11:44:51,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:51,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:44:51,747 INFO L229 MonitoredProcess]: Starting monitored process 3 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:44:51,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-09-17 11:44:51,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-17 11:44:51,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 11:44:51,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-09-17 11:44:51,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:51,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:44:51,807 INFO L229 MonitoredProcess]: Starting monitored process 4 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:44:51,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-09-17 11:44:51,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-09-17 11:44:51,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 11:44:51,860 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-09-17 11:44:51,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-09-17 11:44:51,865 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:44:51,865 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:44:51,865 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:44:51,865 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:44:51,865 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:44:51,865 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:51,865 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:44:51,865 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:44:51,865 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy11.wvr.c_BEv2_Iteration1_Loop [2023-09-17 11:44:51,866 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:44:51,866 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:44:51,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:44:51,953 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:44:51,956 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:44:51,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:51,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:44:51,975 INFO L229 MonitoredProcess]: Starting monitored process 5 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:44:51,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:44:51,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:44:51,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:44:51,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:44:51,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:44:51,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:44:51,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:44:51,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-09-17 11:44:51,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:44:52,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-09-17 11:44:52,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:44:52,029 INFO L229 MonitoredProcess]: Starting monitored process 6 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:44:52,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-09-17 11:44:52,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:44:52,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:44:52,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:44:52,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:44:52,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:44:52,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:44:52,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:44:52,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:44:52,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-09-17 11:44:52,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:52,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:44:52,072 INFO L229 MonitoredProcess]: Starting monitored process 7 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:44:52,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-09-17 11:44:52,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:44:52,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:44:52,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:44:52,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:44:52,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:44:52,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:44:52,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:44:52,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:44:52,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:44:52,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-09-17 11:44:52,109 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-09-17 11:44:52,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:44:52,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:44:52,151 INFO L229 MonitoredProcess]: Starting monitored process 8 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:44:52,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-09-17 11:44:52,153 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:44:52,153 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-09-17 11:44:52,154 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:44:52,154 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_~x~1) = -2*thread2Thread1of1ForFork1_~x~1 + 19999 Supporting invariants [] [2023-09-17 11:44:52,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-09-17 11:44:52,162 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-09-17 11:44:52,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:44:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:44:52,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjunts are in the unsatisfiable core [2023-09-17 11:44:52,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:44:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:44:52,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-17 11:44:52,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:44:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:44:52,321 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-09-17 11:44:52,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:44:52,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-09-17 11:44:53,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) Result 56156 states and 181674 transitions. Complement of second has 9 states. [2023-09-17 11:44:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-17 11:44:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:44:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2023-09-17 11:44:53,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 195 transitions. Stem has 48 letters. Loop has 8 letters. [2023-09-17 11:44:53,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:44:53,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 195 transitions. Stem has 56 letters. Loop has 8 letters. [2023-09-17 11:44:53,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:44:53,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 195 transitions. Stem has 48 letters. Loop has 16 letters. [2023-09-17 11:44:53,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:44:53,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56156 states and 181674 transitions. [2023-09-17 11:44:54,186 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:44:54,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56156 states to 0 states and 0 transitions. [2023-09-17 11:44:54,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 11:44:54,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 11:44:54,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 11:44:54,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:44:54,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:44:54,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:44:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:44:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-17 11:44:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-17 11:44:54,191 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:44:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:44:54,193 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2023-09-17 11:44:54,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2023-09-17 11:44:54,193 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:44:54,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2023-09-17 11:44:54,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 11:44:54,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 11:44:54,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 11:44:54,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:44:54,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:44:54,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:44:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-17 11:44:54,194 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:44:54,194 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:44:54,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 11:44:54,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:44:54,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 11:44:54,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:44:54 BoogieIcfgContainer [2023-09-17 11:44:54,199 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:44:54,200 INFO L158 Benchmark]: Toolchain (without parser) took 4471.68ms. Allocated memory was 246.4MB in the beginning and 744.5MB in the end (delta: 498.1MB). Free memory was 198.3MB in the beginning and 428.1MB in the end (delta: -229.8MB). Peak memory consumption was 268.3MB. Max. memory is 8.0GB. [2023-09-17 11:44:54,200 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:44:54,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.11ms. Allocated memory is still 246.4MB. Free memory was 197.8MB in the beginning and 187.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-09-17 11:44:54,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.70ms. Allocated memory is still 246.4MB. Free memory was 187.3MB in the beginning and 185.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 11:44:54,205 INFO L158 Benchmark]: Boogie Preprocessor took 15.84ms. Allocated memory is still 246.4MB. Free memory was 185.7MB in the beginning and 184.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:44:54,205 INFO L158 Benchmark]: RCFGBuilder took 250.79ms. Allocated memory is still 246.4MB. Free memory was 184.7MB in the beginning and 172.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 11:44:54,205 INFO L158 Benchmark]: BuchiAutomizer took 3998.73ms. Allocated memory was 246.4MB in the beginning and 744.5MB in the end (delta: 498.1MB). Free memory was 172.1MB in the beginning and 428.1MB in the end (delta: -256.0MB). Peak memory consumption was 242.1MB. Max. memory is 8.0GB. [2023-09-17 11:44:54,209 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 183.5MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.11ms. Allocated memory is still 246.4MB. Free memory was 197.8MB in the beginning and 187.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.70ms. Allocated memory is still 246.4MB. Free memory was 187.3MB in the beginning and 185.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.84ms. Allocated memory is still 246.4MB. Free memory was 185.7MB in the beginning and 184.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.79ms. Allocated memory is still 246.4MB. Free memory was 184.7MB in the beginning and 172.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3998.73ms. Allocated memory was 246.4MB in the beginning and 744.5MB in the end (delta: 498.1MB). Free memory was 172.1MB in the beginning and 428.1MB in the end (delta: -256.0MB). Peak memory consumption was 242.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19999 + x * -2 and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 102 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax277 hnf100 lsp20 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-17 11:44:54,227 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...