/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:55:06,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:55:06,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:55:06,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:55:06,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:55:06,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:55:06,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:55:06,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:55:06,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:55:06,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:55:06,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:55:06,583 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:55:06,584 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:55:06,585 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:55:06,585 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:55:06,585 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:55:06,585 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:55:06,585 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:55:06,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:55:06,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:55:06,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:55:06,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:55:06,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:55:06,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:55:06,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:55:06,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:55:06,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:55:06,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:55:06,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:55:06,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:55:06,589 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:55:06,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:55:06,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:55:06,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:55:06,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:55:06,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:55:06,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:55:06,591 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:55:06,591 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:55:06,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:55:06,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:55:06,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:55:06,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:55:06,918 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:55:06,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c [2024-02-10 00:55:08,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:55:08,296 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:55:08,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c [2024-02-10 00:55:08,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c03b80d9/0766519a1470438f8d1408dfba696c63/FLAGa930a46af [2024-02-10 00:55:08,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c03b80d9/0766519a1470438f8d1408dfba696c63 [2024-02-10 00:55:08,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:55:08,318 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:55:08,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:55:08,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:55:08,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:55:08,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@83e1f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08, skipping insertion in model container [2024-02-10 00:55:08,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,346 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:55:08,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:55:08,519 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:55:08,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:55:08,546 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:55:08,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08 WrapperNode [2024-02-10 00:55:08,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:55:08,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:55:08,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:55:08,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:55:08,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,576 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2024-02-10 00:55:08,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:55:08,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:55:08,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:55:08,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:55:08,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:55:08,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:55:08,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:55:08,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:55:08,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (1/1) ... [2024-02-10 00:55:08,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:08,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:08,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:55:08,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:55:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:55:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:55:08,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:55:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:55:08,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:55:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:55:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:55:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:55:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:55:08,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:55:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:55:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:55:08,663 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:55:08,729 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:55:08,731 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:55:08,862 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:55:08,868 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:55:08,869 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 00:55:08,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:55:08 BoogieIcfgContainer [2024-02-10 00:55:08,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:55:08,871 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:55:08,871 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:55:08,875 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:55:08,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:08,875 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:55:08" (1/3) ... [2024-02-10 00:55:08,876 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bd13fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:55:08, skipping insertion in model container [2024-02-10 00:55:08,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:08,876 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:08" (2/3) ... [2024-02-10 00:55:08,877 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bd13fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:55:08, skipping insertion in model container [2024-02-10 00:55:08,877 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:08,877 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:55:08" (3/3) ... [2024-02-10 00:55:08,878 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-easy1.wvr.c [2024-02-10 00:55:08,945 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:55:08,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 182 flow [2024-02-10 00:55:08,994 INFO L124 PetriNetUnfolderBase]: 6/80 cut-off events. [2024-02-10 00:55:08,995 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:55:08,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 6/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-10 00:55:08,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 84 transitions, 182 flow [2024-02-10 00:55:09,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 80 transitions, 172 flow [2024-02-10 00:55:09,010 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:55:09,010 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:55:09,010 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:55:09,010 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:55:09,010 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:55:09,011 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:55:09,011 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:55:09,011 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:55:09,011 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 places, 80 transitions, 172 flow [2024-02-10 00:55:09,023 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:09,023 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-02-10 00:55:09,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:55:09,023 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:09,026 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:55:09,026 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 places, 80 transitions, 172 flow [2024-02-10 00:55:09,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:09,035 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-02-10 00:55:09,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:55:09,035 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:09,041 INFO L748 eck$LassoCheckResult]: Stem: 87#[$Ultimate##0]true [132] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 89#[L-1]true [144] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 91#[L21]true [131] 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[] 93#[L21-1]true [160] 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[] 95#[L21-2]true [158] 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[] 97#[L21-3]true [122] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 99#[L21-4]true [179] L21-4-->L38: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 101#[L38]true [180] L38-->L-1-1: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] 103#[L-1-1]true [169] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 105#[L-1-2]true [172] L-1-2-->L57: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] 107#[L57]true [182] L57-->L57-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] 109#[L57-1]true [118] L57-1-->L57-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] 111#[L57-2]true [168] L57-2-->L59: 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] 113#[L59]true [139] L59-->L59-1: Formula: (= v_~x1~0_6 |v_ULTIMATE.start_main_#t~nondet3#1_3|) 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|, ~x1~0=v_~x1~0_6} AuxVars[] AssignedVars[~x1~0] 115#[L59-1]true [113] L59-1-->L60: 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] 117#[L60]true [175] L60-->L60-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] 119#[L60-1]true [142] L60-1-->L60-2: Formula: (= v_~x2~0_6 |v_ULTIMATE.start_main_#t~nondet4#1_3|) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} OutVars{~x2~0=v_~x2~0_6, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[~x2~0] 121#[L60-2]true [127] L60-2-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] 123#[L61]true [107] L61-->L61-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~x1~0_7) (= v_~x1~0_7 v_~x2~0_7)) 1 0)) InVars {~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7} OutVars{~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7, 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] 125#[L61-1]true [153] L61-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 127#[L34]true [130] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 129#[L35]true [162] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 131#[L34-1]true [155] L34-1-->L61-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 133#[L61-2]true [159] L61-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 135#[L64]true [125] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 137#[L64-1]true [171] L64-1-->L64-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 139#[L64-2]true [184] L64-2-->L64-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_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~pre5#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 141#[L64-3]true [205] L64-3-->L41-1: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, 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} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 143#[L41-1, L64-4]true [2024-02-10 00:55:09,042 INFO L750 eck$LassoCheckResult]: Loop: 143#[L41-1, L64-4]true [187] L41-1-->L42: Formula: (< v_~x1~0_2 10000) InVars {~x1~0=v_~x1~0_2} OutVars{~x1~0=v_~x1~0_2} AuxVars[] AssignedVars[] 146#[L42, L64-4]true [190] L42-->L42-1: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {~x1~0=v_~x1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 148#[L42-1, L64-4]true [192] L42-1-->L42-2: Formula: (= v_~x1~0_4 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|, ~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] 150#[L64-4, L42-2]true [194] L42-2-->L41-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 143#[L41-1, L64-4]true [2024-02-10 00:55:09,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1367237359, now seen corresponding path program 1 times [2024-02-10 00:55:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027135308] [2024-02-10 00:55:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:09,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:09,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:09,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 6683174, now seen corresponding path program 1 times [2024-02-10 00:55:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176659322] [2024-02-10 00:55:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:09,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:09,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:09,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash 733122358, now seen corresponding path program 1 times [2024-02-10 00:55:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219590694] [2024-02-10 00:55:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:09,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:09,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:09,356 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:55:09,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:55:09,357 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:55:09,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:55:09,357 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 00:55:09,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:09,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:55:09,358 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:55:09,358 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration1_Loop [2024-02-10 00:55:09,358 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:55:09,358 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:55:09,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,459 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:55:09,459 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 00:55:09,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:09,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:09,463 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) [2024-02-10 00:55:09,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:55:09,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:55:09,485 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 [2024-02-10 00:55:09,493 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:55:09,493 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: [] [2024-02-10 00:55:09,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:09,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:09,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:09,521 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) [2024-02-10 00:55:09,530 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 [2024-02-10 00:55:09,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:55:09,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:55:09,556 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:55:09,556 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post1=0} Honda state: {thread1Thread1of1ForFork0_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:55:09,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:09,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:09,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:09,564 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) [2024-02-10 00:55:09,569 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 [2024-02-10 00:55:09,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:55:09,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:55:09,599 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 [2024-02-10 00:55:09,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:09,601 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) [2024-02-10 00:55:09,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 00:55:09,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:55:09,612 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 [2024-02-10 00:55:09,627 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 00:55:09,635 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 [2024-02-10 00:55:09,636 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:55:09,636 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:55:09,636 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:55:09,636 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:55:09,636 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:55:09,636 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:09,637 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:55:09,637 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:55:09,637 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration1_Loop [2024-02-10 00:55:09,637 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:55:09,637 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:55:09,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:09,745 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:55:09,749 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:55:09,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:09,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:09,800 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) [2024-02-10 00:55:09,803 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 [2024-02-10 00:55:09,804 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 [2024-02-10 00:55:09,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:09,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:09,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:09,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:09,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:09,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:09,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:09,855 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 [2024-02-10 00:55:09,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:09,869 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) [2024-02-10 00:55:09,955 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 [2024-02-10 00:55:09,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:09,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:09,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:09,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:09,968 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 [2024-02-10 00:55:09,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:55:09,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:55:09,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:10,003 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 [2024-02-10 00:55:10,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:10,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:10,005 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) [2024-02-10 00:55:10,010 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 [2024-02-10 00:55:10,010 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 [2024-02-10 00:55:10,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:10,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:10,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:10,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:10,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:10,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:10,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:10,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:55:10,039 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 [2024-02-10 00:55:10,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:10,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:10,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:55:10,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 00:55:10,045 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 [2024-02-10 00:55:10,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:10,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:10,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:10,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:10,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:10,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:10,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:10,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:55:10,069 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:55:10,069 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:55:10,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:10,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:10,073 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:55:10,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 00:55:10,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:55:10,076 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 00:55:10,076 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:55:10,077 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~x1~0) = -2*~x1~0 + 19999 Supporting invariants [] [2024-02-10 00:55:10,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-10 00:55:10,083 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:55:10,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:55:10,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:55:10,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:55:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:55:10,227 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:55:10,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:55:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:55:10,331 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-10 00:55:10,334 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:55:10,615 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 1508 transitions.8 powerset states5 rank states. The highest rank that occured is 1 [2024-02-10 00:55:10,616 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:55:10,617 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:55:10,619 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:55:10,686 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:55:10,687 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:55:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-10 00:55:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:55:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 576 transitions. [2024-02-10 00:55:10,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 576 transitions. Stem has 28 letters. Loop has 4 letters. [2024-02-10 00:55:10,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:10,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 576 transitions. Stem has 32 letters. Loop has 4 letters. [2024-02-10 00:55:10,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:10,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 576 transitions. Stem has 28 letters. Loop has 8 letters. [2024-02-10 00:55:10,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:10,705 INFO L428 stractBuchiCegarLoop]: Abstraction has has 94 places, 1432 transitions, 5944 flow [2024-02-10 00:55:10,705 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:55:10,705 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 94 places, 1432 transitions, 5944 flow [2024-02-10 00:55:10,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:10,947 INFO L124 PetriNetUnfolderBase]: 493/757 cut-off events. [2024-02-10 00:55:10,947 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-10 00:55:10,947 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:10,950 INFO L748 eck$LassoCheckResult]: Stem: 87#[$Ultimate##0]true [132] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 89#[L-1]true [144] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 91#[L21]true [131] 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[] 93#[L21-1]true [160] 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[] 95#[L21-2]true [158] 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[] 97#[L21-3]true [122] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 99#[L21-4]true [179] L21-4-->L38: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 101#[L38]true [180] L38-->L-1-1: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] 103#[L-1-1]true [169] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 105#[L-1-2]true [172] L-1-2-->L57: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] 107#[L57]true [182] L57-->L57-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] 109#[L57-1]true [118] L57-1-->L57-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] 111#[L57-2]true [168] L57-2-->L59: 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] 113#[L59]true [139] L59-->L59-1: Formula: (= v_~x1~0_6 |v_ULTIMATE.start_main_#t~nondet3#1_3|) 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|, ~x1~0=v_~x1~0_6} AuxVars[] AssignedVars[~x1~0] 115#[L59-1]true [113] L59-1-->L60: 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] 117#[L60]true [175] L60-->L60-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] 119#[L60-1]true [142] L60-1-->L60-2: Formula: (= v_~x2~0_6 |v_ULTIMATE.start_main_#t~nondet4#1_3|) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} OutVars{~x2~0=v_~x2~0_6, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[~x2~0] 121#[L60-2]true [127] L60-2-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] 123#[L61]true [107] L61-->L61-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~x1~0_7) (= v_~x1~0_7 v_~x2~0_7)) 1 0)) InVars {~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7} OutVars{~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7, 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] 125#[L61-1]true [153] L61-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 127#[L34]true [130] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 129#[L35]true [162] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 131#[L34-1]true [155] L34-1-->L61-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 133#[L61-2]true [159] L61-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 135#[L64]true [125] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 137#[L64-1]true [171] L64-1-->L64-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 139#[L64-2]true [184] L64-2-->L64-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_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~pre5#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 141#[L64-3]true [205] L64-3-->L41-1: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, 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} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 143#[L41-1, L64-4]true [145] L64-4-->L64-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] 346#[L64-5, L41-1]true [141] L64-5-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 348#[L41-1, L65]true [185] L65-->L65-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] 350#[L65-1, L41-1]true [165] L65-1-->L65-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 352#[L41-1, L65-2]true [143] L65-2-->L65-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 354#[L41-1, L65-3]true [208] L65-3-->L49-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre7#1_7| v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_8|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|, 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_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 356#[L65-4, L49-1, L41-1]true [195] L49-1-->L50: Formula: (< v_~x2~0_2 10000) InVars {~x2~0=v_~x2~0_2} OutVars{~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[] 358#[L65-4, L50, L41-1]true [198] L50-->L50-1: Formula: (= v_~x2~0_3 |v_thread2Thread1of1ForFork1_#t~post2_1|) InVars {~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 360#[L65-4, L41-1, L50-1]true [200] L50-1-->L50-2: Formula: (= v_~x2~0_4 (+ |v_thread2Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} OutVars{~x2~0=v_~x2~0_4, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[~x2~0] 362#[L65-4, L41-1, L50-2]true [202] L50-2-->L49-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 356#[L65-4, L49-1, L41-1]true [2024-02-10 00:55:10,950 INFO L750 eck$LassoCheckResult]: Loop: 356#[L65-4, L49-1, L41-1]true [195] L49-1-->L50: Formula: (< v_~x2~0_2 10000) InVars {~x2~0=v_~x2~0_2} OutVars{~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[] 358#[L65-4, L50, L41-1]true [198] L50-->L50-1: Formula: (= v_~x2~0_3 |v_thread2Thread1of1ForFork1_#t~post2_1|) InVars {~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 360#[L65-4, L41-1, L50-1]true [200] L50-1-->L50-2: Formula: (= v_~x2~0_4 (+ |v_thread2Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} OutVars{~x2~0=v_~x2~0_4, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[~x2~0] 362#[L65-4, L41-1, L50-2]true [202] L50-2-->L49-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 356#[L65-4, L49-1, L41-1]true [2024-02-10 00:55:10,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1756574145, now seen corresponding path program 1 times [2024-02-10 00:55:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:10,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422328539] [2024-02-10 00:55:10,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:10,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:11,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:11,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash 6929446, now seen corresponding path program 1 times [2024-02-10 00:55:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715128408] [2024-02-10 00:55:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:11,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:11,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:11,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:11,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1812544356, now seen corresponding path program 2 times [2024-02-10 00:55:11,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:11,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872419178] [2024-02-10 00:55:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:11,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:11,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:11,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:11,077 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:55:11,078 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:55:11,078 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:55:11,080 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:55:11,081 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 00:55:11,081 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:11,081 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:55:11,081 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:55:11,081 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration2_Loop [2024-02-10 00:55:11,081 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:55:11,081 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:55:11,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,147 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:55:11,147 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 00:55:11,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:11,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:11,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:55:11,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:55:11,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:55:11,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:55:11,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:11,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:11,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:11,209 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:55:11,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:55:11,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 00:55:11,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:55:11,256 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 00:55:11,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:11,271 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:55:11,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:55:11,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:55:11,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:55:11,272 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:55:11,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:11,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:55:11,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:55:11,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration2_Loop [2024-02-10 00:55:11,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:55:11,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:55:11,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:55:11,333 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:55:11,334 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:55:11,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:11,335 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:55:11,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:55:11,339 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 [2024-02-10 00:55:11,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:55:11,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:55:11,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:55:11,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:55:11,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:55:11,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:55:11,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:55:11,359 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:55:11,361 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:55:11,361 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:55:11,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:11,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:11,364 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:55:11,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:55:11,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:55:11,365 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 00:55:11,366 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:55:11,366 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~x2~0) = -2*~x2~0 + 19999 Supporting invariants [] [2024-02-10 00:55:11,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:11,370 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:55:11,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:55:11,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:55:11,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:55:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:55:11,470 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:55:11,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:55:11,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:11,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:55:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:55:11,548 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-10 00:55:11,548 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:55:11,691 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 13 states and 1508 transitions.8 powerset states5 rank states. The highest rank that occured is 1 [2024-02-10 00:55:11,691 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:55:11,691 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:55:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states and 1508 transitions. [2024-02-10 00:55:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1508 transitions. [2024-02-10 00:55:11,704 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:55:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states and 1508 transitions. [2024-02-10 00:55:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1508 transitions. [2024-02-10 00:55:12,651 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:55:12,651 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:55:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-10 00:55:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:55:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 576 transitions. [2024-02-10 00:55:12,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 576 transitions. Stem has 38 letters. Loop has 4 letters. [2024-02-10 00:55:12,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:12,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 576 transitions. Stem has 42 letters. Loop has 4 letters. [2024-02-10 00:55:12,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:12,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 576 transitions. Stem has 38 letters. Loop has 8 letters. [2024-02-10 00:55:12,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:55:12,657 INFO L428 stractBuchiCegarLoop]: Abstraction has has 113 places, 34248 transitions, 210717 flow [2024-02-10 00:55:12,657 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:55:12,657 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 113 places, 34248 transitions, 210717 flow [2024-02-10 00:55:29,280 INFO L124 PetriNetUnfolderBase]: 11940/15085 cut-off events. [2024-02-10 00:55:29,281 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-02-10 00:55:29,281 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 00:55:29,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:55:29 BoogieIcfgContainer [2024-02-10 00:55:29,287 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:55:29,287 INFO L158 Benchmark]: Toolchain (without parser) took 20968.47ms. Allocated memory was 192.9MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 156.2MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 00:55:29,287 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:55:29,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.95ms. Allocated memory was 192.9MB in the beginning and 297.8MB in the end (delta: 104.9MB). Free memory was 156.2MB in the beginning and 269.2MB in the end (delta: -113.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 00:55:29,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.29ms. Allocated memory is still 297.8MB. Free memory was 268.7MB in the beginning and 267.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:55:29,289 INFO L158 Benchmark]: Boogie Preprocessor took 20.84ms. Allocated memory is still 297.8MB. Free memory was 267.1MB in the beginning and 266.2MB in the end (delta: 978.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:55:29,289 INFO L158 Benchmark]: RCFGBuilder took 272.67ms. Allocated memory is still 297.8MB. Free memory was 266.2MB in the beginning and 253.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-02-10 00:55:29,290 INFO L158 Benchmark]: BuchiAutomizer took 20415.17ms. Allocated memory was 297.8MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 253.6MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 00:55:29,292 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.95ms. Allocated memory was 192.9MB in the beginning and 297.8MB in the end (delta: 104.9MB). Free memory was 156.2MB in the beginning and 269.2MB in the end (delta: -113.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.29ms. Allocated memory is still 297.8MB. Free memory was 268.7MB in the beginning and 267.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.84ms. Allocated memory is still 297.8MB. Free memory was 267.1MB in the beginning and 266.2MB in the end (delta: 978.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 272.67ms. Allocated memory is still 297.8MB. Free memory was 266.2MB in the beginning and 253.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 20415.17ms. Allocated memory was 297.8MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 253.6MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 1.2GB. 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 (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (19999 + (-2 * x1)) and consists of 7 locations. One deterministic module has affine ranking function (19999 + (-2 * x2)) and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.3s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 1. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 752 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 750 mSDsluCounter, 1646 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1076 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 570 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax419 hnf100 lsp23 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 82ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 00:55:29,307 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...