/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs NONE -i ../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-a3464b2-m [2023-08-18 16:53:01,479 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-08-18 16:53:01,524 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-08-18 16:53:01,545 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-18 16:53:01,546 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-18 16:53:01,547 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-18 16:53:01,548 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-18 16:53:01,548 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-08-18 16:53:01,548 INFO L137 SettingsManager]: * Use SBE=true [2023-08-18 16:53:01,552 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-08-18 16:53:01,552 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-08-18 16:53:01,552 INFO L137 SettingsManager]: * Use old map elimination=false [2023-08-18 16:53:01,553 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-08-18 16:53:01,554 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-08-18 16:53:01,554 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-08-18 16:53:01,555 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-18 16:53:01,555 INFO L137 SettingsManager]: * sizeof long=4 [2023-08-18 16:53:01,555 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-18 16:53:01,555 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-18 16:53:01,556 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-08-18 16:53:01,556 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-08-18 16:53:01,556 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-08-18 16:53:01,556 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-08-18 16:53:01,557 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-08-18 16:53:01,557 INFO L137 SettingsManager]: * sizeof long double=12 [2023-08-18 16:53:01,557 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-08-18 16:53:01,557 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-08-18 16:53:01,557 INFO L137 SettingsManager]: * Use constant arrays=true [2023-08-18 16:53:01,558 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-08-18 16:53:01,558 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-18 16:53:01,559 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-18 16:53:01,559 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-18 16:53:01,559 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-18 16:53:01,559 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-08-18 16:53:01,560 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-08-18 16:53:01,561 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> NONE [2023-08-18 16:53:01,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-18 16:53:01,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-18 16:53:01,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-18 16:53:01,821 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-18 16:53:01,822 INFO L274 PluginConnector]: CDTParser initialized [2023-08-18 16:53:01,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c [2023-08-18 16:53:03,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-18 16:53:03,161 INFO L384 CDTParser]: Found 1 translation units. [2023-08-18 16:53:03,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c [2023-08-18 16:53:03,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcbddd18d/2e00f01e44a04ad5b5de53fcd9401b60/FLAG99eef46b4 [2023-08-18 16:53:03,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcbddd18d/2e00f01e44a04ad5b5de53fcd9401b60 [2023-08-18 16:53:03,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-18 16:53:03,184 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-18 16:53:03,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-18 16:53:03,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-18 16:53:03,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-18 16:53:03,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea96c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03, skipping insertion in model container [2023-08-18 16:53:03,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-18 16:53:03,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-18 16:53:03,335 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c[1876,1889] [2023-08-18 16:53:03,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-18 16:53:03,345 INFO L203 MainTranslator]: Completed pre-run [2023-08-18 16:53:03,359 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c[1876,1889] [2023-08-18 16:53:03,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-18 16:53:03,372 INFO L208 MainTranslator]: Completed translation [2023-08-18 16:53:03,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03 WrapperNode [2023-08-18 16:53:03,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-18 16:53:03,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-18 16:53:03,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-18 16:53:03,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-18 16:53:03,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,410 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2023-08-18 16:53:03,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-18 16:53:03,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-18 16:53:03,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-18 16:53:03,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-18 16:53:03,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-18 16:53:03,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-18 16:53:03,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-18 16:53:03,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-18 16:53:03,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (1/1) ... [2023-08-18 16:53:03,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:03,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:03,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-08-18 16:53:03,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-08-18 16:53:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-18 16:53:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-18 16:53:03,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-18 16:53:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-18 16:53:03,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-18 16:53:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-18 16:53:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-18 16:53:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-18 16:53:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-18 16:53:03,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-18 16:53:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-18 16:53:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-18 16:53:03,524 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-18 16:53:03,633 INFO L236 CfgBuilder]: Building ICFG [2023-08-18 16:53:03,636 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-18 16:53:03,760 INFO L277 CfgBuilder]: Performing block encoding [2023-08-18 16:53:03,766 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-18 16:53:03,766 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-18 16:53:03,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 04:53:03 BoogieIcfgContainer [2023-08-18 16:53:03,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-18 16:53:03,769 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-08-18 16:53:03,769 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-08-18 16:53:03,772 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-08-18 16:53:03,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:53:03,773 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.08 04:53:03" (1/3) ... [2023-08-18 16:53:03,774 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f3f7d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.08 04:53:03, skipping insertion in model container [2023-08-18 16:53:03,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:53:03,774 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:53:03" (2/3) ... [2023-08-18 16:53:03,775 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f3f7d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.08 04:53:03, skipping insertion in model container [2023-08-18 16:53:03,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:53:03,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 04:53:03" (3/3) ... [2023-08-18 16:53:03,776 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-easy1.wvr.c [2023-08-18 16:53:03,880 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-18 16:53:03,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 77 transitions, 170 flow [2023-08-18 16:53:03,978 INFO L124 PetriNetUnfolderBase]: 6/73 cut-off events. [2023-08-18 16:53:03,979 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-18 16:53:03,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 6/73 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/67 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2023-08-18 16:53:03,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 77 transitions, 170 flow [2023-08-18 16:53:03,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 73 transitions, 158 flow [2023-08-18 16:53:04,003 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-08-18 16:53:04,004 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-08-18 16:53:04,004 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-08-18 16:53:04,004 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-08-18 16:53:04,004 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-08-18 16:53:04,004 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-08-18 16:53:04,004 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-08-18 16:53:04,004 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-08-18 16:53:04,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-08-18 16:53:04,128 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 196 [2023-08-18 16:53:04,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:53:04,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:53:04,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-18 16:53:04,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-08-18 16:53:04,134 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-08-18 16:53:04,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 301 states, but on-demand construction may add more states [2023-08-18 16:53:04,149 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 196 [2023-08-18 16:53:04,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:53:04,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:53:04,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-18 16:53:04,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-08-18 16:53:04,158 INFO L748 eck$LassoCheckResult]: Stem: 79#[$Ultimate##0]don't care [122] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 82#[L-1]don't care [132] L-1-->L-1-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 84#[L-1-1]don't care [156] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 86#[L21]don't care [121] 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[] 88#[L21-1]don't care [147] 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[] 90#[L21-2]don't care [146] 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[] 92#[L21-3]don't care [113] 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[] 94#[L21-4]don't care [165] L21-4-->L38: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 96#[L38]don't care [166] L38-->L-1-2: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] 98#[L-1-2]don't care [158] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 100#[L-1-3]don't care [163] L-1-3-->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] 102#[L57]don't care [168] 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] 104#[L57-1]don't care [110] 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] 106#[L57-2]don't care [155] 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] 108#[L59]don't care [128] 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] 110#[L59-1]don't care [105] 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] 112#[L60]don't care [161] 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] 114#[L60-1]don't care [130] 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] 116#[L60-2]don't care [117] 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] 118#[L61]don't care [99] 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] 120#[L61-1]don't care [141] 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] 122#[L34]don't care [120] 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] 124#[L35]don't care [149] 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[] 128#[L34-1]don't care [143] L34-1-->L64: 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] 130#[L64]don't care [116] L64-->L64-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 132#[L64-1]don't care [157] L64-1-->L64-2: 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] 134#[L64-2]don't care [190] L64-2-->L41-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, 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] 136#[L64-3, L41-1]don't care [2023-08-18 16:53:04,158 INFO L750 eck$LassoCheckResult]: Loop: 136#[L64-3, L41-1]don't care [172] 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[] 140#[L42, L64-3]don't care [175] 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] 150#[L64-3, L42-1]don't care [177] 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] 164#[L42-2, L64-3]don't care [179] L42-2-->L41-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 136#[L64-3, L41-1]don't care [2023-08-18 16:53:04,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:53:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2132646131, now seen corresponding path program 1 times [2023-08-18 16:53:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:53:04,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162474646] [2023-08-18 16:53:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:53:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:53:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:04,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:53:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:04,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:53:04,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:53:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash 6221414, now seen corresponding path program 1 times [2023-08-18 16:53:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:53:04,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970453703] [2023-08-18 16:53:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:53:04,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:53:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:04,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:53:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:04,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:53:04,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:53:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 339918424, now seen corresponding path program 1 times [2023-08-18 16:53:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:53:04,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610846414] [2023-08-18 16:53:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:53:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:53:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:04,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:53:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:04,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:53:04,460 INFO L210 LassoAnalysis]: Preferences: [2023-08-18 16:53:04,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-08-18 16:53:04,460 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-08-18 16:53:04,461 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-08-18 16:53:04,461 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-08-18 16:53:04,461 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,461 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-08-18 16:53:04,462 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-08-18 16:53:04,462 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration1_Loop [2023-08-18 16:53:04,462 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-08-18 16:53:04,462 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-08-18 16:53:04,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,594 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-08-18 16:53:04,594 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-08-18 16:53:04,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:04,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-08-18 16:53:04,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-08-18 16:53:04,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-08-18 16:53:04,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-08-18 16:53:04,630 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-08-18 16:53:04,631 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-08-18 16:53:04,637 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 [2023-08-18 16:53:04,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:04,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-08-18 16:53:04,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-08-18 16:53:04,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-08-18 16:53:04,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-08-18 16:53:04,661 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-08-18 16:53:04,661 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post1=0} Honda state: {thread1Thread1of1ForFork0_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-08-18 16:53:04,667 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 [2023-08-18 16:53:04,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:04,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-08-18 16:53:04,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-08-18 16:53:04,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-08-18 16:53:04,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-08-18 16:53:04,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-08-18 16:53:04,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:04,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-08-18 16:53:04,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-08-18 16:53:04,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-08-18 16:53:04,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-08-18 16:53:04,726 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-08-18 16:53:04,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-08-18 16:53:04,730 INFO L210 LassoAnalysis]: Preferences: [2023-08-18 16:53:04,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-08-18 16:53:04,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-08-18 16:53:04,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-08-18 16:53:04,731 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-08-18 16:53:04,731 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-08-18 16:53:04,731 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-08-18 16:53:04,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration1_Loop [2023-08-18 16:53:04,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-08-18 16:53:04,731 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-08-18 16:53:04,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:04,817 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-08-18 16:53:04,822 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-08-18 16:53:04,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:04,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-08-18 16:53:04,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-08-18 16:53:04,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 16:53:04,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 16:53:04,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 16:53:04,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 16:53:04,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 16:53:04,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 16:53:04,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 16:53:04,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 16:53:04,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-08-18 16:53:04,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:04,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-08-18 16:53:04,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-08-18 16:53:04,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 16:53:04,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 16:53:04,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 16:53:04,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 16:53:04,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 16:53:04,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-08-18 16:53:04,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-08-18 16:53:04,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 16:53:04,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-08-18 16:53:04,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:04,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-08-18 16:53:04,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 16:53:04,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 16:53:04,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-08-18 16:53:04,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 16:53:04,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 16:53:04,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 16:53:04,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-08-18 16:53:04,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-08-18 16:53:04,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-08-18 16:53:04,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-08-18 16:53:04,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-08-18 16:53:04,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:04,943 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) [2023-08-18 16:53:04,944 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 [2023-08-18 16:53:04,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 16:53:04,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 16:53:04,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-08-18 16:53:04,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 16:53:04,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 16:53:04,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 16:53:04,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-08-18 16:53:04,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-08-18 16:53:04,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-08-18 16:53:04,966 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-08-18 16:53:04,966 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-08-18 16:53:04,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:04,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:05,003 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) [2023-08-18 16:53:05,005 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 [2023-08-18 16:53:05,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-08-18 16:53:05,006 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-08-18 16:53:05,006 INFO L513 LassoAnalysis]: Proved termination. [2023-08-18 16:53:05,007 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~x1~0) = -2*~x1~0 + 19999 Supporting invariants [] [2023-08-18 16:53:05,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-08-18 16:53:05,016 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-08-18 16:53:05,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:53:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:53:05,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-18 16:53:05,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-18 16:53:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:53:05,149 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-18 16:53:05,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-18 16:53:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 16:53:05,250 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 [2023-08-18 16:53:05,253 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 301 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:53:05,428 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 301 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 938 states and 2550 transitions. Complement of second has 9 states. [2023-08-18 16:53:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-08-18 16:53:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:53:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2023-08-18 16:53:05,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 169 transitions. Stem has 27 letters. Loop has 4 letters. [2023-08-18 16:53:05,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 16:53:05,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 169 transitions. Stem has 31 letters. Loop has 4 letters. [2023-08-18 16:53:05,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 16:53:05,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 169 transitions. Stem has 27 letters. Loop has 8 letters. [2023-08-18 16:53:05,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 16:53:05,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 938 states and 2550 transitions. [2023-08-18 16:53:05,453 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 124 [2023-08-18 16:53:05,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 938 states to 345 states and 889 transitions. [2023-08-18 16:53:05,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2023-08-18 16:53:05,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2023-08-18 16:53:05,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 345 states and 889 transitions. [2023-08-18 16:53:05,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-08-18 16:53:05,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 345 states and 889 transitions. [2023-08-18 16:53:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states and 889 transitions. [2023-08-18 16:53:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 302. [2023-08-18 16:53:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 302 states have (on average 2.5099337748344372) internal successors, (758), 301 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:53:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 758 transitions. [2023-08-18 16:53:05,508 INFO L240 hiAutomatonCegarLoop]: Abstraction has 302 states and 758 transitions. [2023-08-18 16:53:05,508 INFO L428 stractBuchiCegarLoop]: Abstraction has 302 states and 758 transitions. [2023-08-18 16:53:05,508 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-08-18 16:53:05,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 758 transitions. [2023-08-18 16:53:05,510 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 124 [2023-08-18 16:53:05,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:53:05,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:53:05,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-18 16:53:05,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-08-18 16:53:05,512 INFO L748 eck$LassoCheckResult]: Stem: 2314#[$Ultimate##0]don't care [122] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 2316#[L-1]don't care [132] L-1-->L-1-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 2328#[L-1-1]don't care [156] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 2202#[L21]don't care [121] 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[] 2204#[L21-1]don't care [147] 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[] 2330#[L21-2]don't care [146] 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[] 2332#[L21-3]don't care [113] 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[] 2124#[L21-4]don't care [165] L21-4-->L38: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 2126#[L38]don't care [166] L38-->L-1-2: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] 2336#[L-1-2]don't care [158] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 2346#[L-1-3]don't care [163] L-1-3-->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] 2258#[L57]don't care [168] 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] 1814#[L57-1]don't care [110] 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] 1816#[L57-2]don't care [155] 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] 2210#[L59]don't care [128] 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] 2212#[L59-1]don't care [105] 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] 2272#[L60]don't care [161] 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] 2326#[L60-1]don't care [130] 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] 2306#[L60-2]don't care [117] 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] 2144#[L61]don't care [99] 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] 2146#[L61-1]don't care [141] 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] 2230#[L34]don't care [120] 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] 2308#[L35]don't care [149] 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[] 2344#[L34-1]don't care [143] L34-1-->L64: 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] 2296#[L64]don't care [116] L64-->L64-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 2298#[L64-1]don't care [157] L64-1-->L64-2: 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] 2260#[L64-2]don't care [190] L64-2-->L41-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, 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] 2262#[L64-3, L41-1]don't care [108] L64-3-->L64-4: 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] 1840#[L41-1, L64-4]don't care [133] L64-4-->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] 2274#[L41-1, L65]don't care [170] 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] 1746#[L41-1, L65-1]don't care [152] 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] 1934#[L41-1, L65-2]don't care [131] 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] 2282#[L65-3, L41-1]don't care [193] L65-3-->L49-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} 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_6|, 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] 2052#[L49-1, L41-1, L65-4]don't care [2023-08-18 16:53:05,513 INFO L750 eck$LassoCheckResult]: Loop: 2052#[L49-1, L41-1, L65-4]don't care [180] 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[] 1756#[L41-1, L65-4, L50]don't care [183] 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] 1760#[L41-1, L65-4, L50-1]don't care [185] 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] 2114#[L50-2, L41-1, L65-4]don't care [187] L50-2-->L49-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] 2052#[L49-1, L41-1, L65-4]don't care [2023-08-18 16:53:05,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:53:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1627192808, now seen corresponding path program 1 times [2023-08-18 16:53:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:53:05,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412328707] [2023-08-18 16:53:05,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:53:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:53:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:05,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:53:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:05,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:53:05,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:53:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash 6467686, now seen corresponding path program 1 times [2023-08-18 16:53:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:53:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686020895] [2023-08-18 16:53:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:53:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:53:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:05,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:53:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:05,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:53:05,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:53:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2091331843, now seen corresponding path program 1 times [2023-08-18 16:53:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:53:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705136906] [2023-08-18 16:53:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:53:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:53:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:05,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:53:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:53:05,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:53:05,613 INFO L210 LassoAnalysis]: Preferences: [2023-08-18 16:53:05,613 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-08-18 16:53:05,613 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-08-18 16:53:05,613 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-08-18 16:53:05,613 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-08-18 16:53:05,613 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:05,613 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-08-18 16:53:05,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-08-18 16:53:05,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration2_Loop [2023-08-18 16:53:05,614 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-08-18 16:53:05,614 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-08-18 16:53:05,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,676 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-08-18 16:53:05,677 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-08-18 16:53:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:05,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:05,681 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) [2023-08-18 16:53:05,684 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 [2023-08-18 16:53:05,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-08-18 16:53:05,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-08-18 16:53:05,712 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 [2023-08-18 16:53:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:05,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:05,714 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) [2023-08-18 16:53:05,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-08-18 16:53:05,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-08-18 16:53:05,739 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 [2023-08-18 16:53:05,743 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-08-18 16:53:05,749 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 [2023-08-18 16:53:05,750 INFO L210 LassoAnalysis]: Preferences: [2023-08-18 16:53:05,750 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-08-18 16:53:05,750 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-08-18 16:53:05,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-08-18 16:53:05,750 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-08-18 16:53:05,750 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:05,750 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-08-18 16:53:05,750 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-08-18 16:53:05,750 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration2_Loop [2023-08-18 16:53:05,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-08-18 16:53:05,750 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-08-18 16:53:05,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-08-18 16:53:05,834 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-08-18 16:53:05,835 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-08-18 16:53:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:05,836 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) [2023-08-18 16:53:05,839 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 [2023-08-18 16:53:05,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-08-18 16:53:05,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-08-18 16:53:05,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-08-18 16:53:05,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-08-18 16:53:05,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-08-18 16:53:05,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-08-18 16:53:05,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-08-18 16:53:05,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-08-18 16:53:05,865 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-08-18 16:53:05,867 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-08-18 16:53:05,868 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-08-18 16:53:05,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:53:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:53:05,871 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) [2023-08-18 16:53:05,872 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 [2023-08-18 16:53:05,874 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-08-18 16:53:05,874 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-08-18 16:53:05,874 INFO L513 LassoAnalysis]: Proved termination. [2023-08-18 16:53:05,874 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~x2~0) = -2*~x2~0 + 19999 Supporting invariants [] [2023-08-18 16:53:05,880 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 [2023-08-18 16:53:05,881 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-08-18 16:53:05,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:53:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:53:05,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-18 16:53:05,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-18 16:53:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:53:05,974 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-18 16:53:05,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-18 16:53:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 16:53:06,018 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 [2023-08-18 16:53:06,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 302 states and 758 transitions. cyclomatic complexity: 497 Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:53:06,081 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 302 states and 758 transitions. cyclomatic complexity: 497. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 663 states and 1879 transitions. Complement of second has 8 states. [2023-08-18 16:53:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-08-18 16:53:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:53:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2023-08-18 16:53:06,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 33 letters. Loop has 4 letters. [2023-08-18 16:53:06,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 16:53:06,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 37 letters. Loop has 4 letters. [2023-08-18 16:53:06,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 16:53:06,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 33 letters. Loop has 8 letters. [2023-08-18 16:53:06,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-08-18 16:53:06,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 663 states and 1879 transitions. [2023-08-18 16:53:06,095 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-08-18 16:53:06,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 663 states to 0 states and 0 transitions. [2023-08-18 16:53:06,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-08-18 16:53:06,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-08-18 16:53:06,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-08-18 16:53:06,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-18 16:53:06,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-08-18 16:53:06,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-08-18 16:53:06,096 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-08-18 16:53:06,096 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-08-18 16:53:06,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-08-18 16:53:06,096 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-08-18 16:53:06,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-08-18 16:53:06,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.08 04:53:06 BoogieIcfgContainer [2023-08-18 16:53:06,104 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-08-18 16:53:06,105 INFO L158 Benchmark]: Toolchain (without parser) took 2920.43ms. Allocated memory was 183.5MB in the beginning and 267.4MB in the end (delta: 83.9MB). Free memory was 132.1MB in the beginning and 97.0MB in the end (delta: 35.1MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. [2023-08-18 16:53:06,105 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-08-18 16:53:06,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.08ms. Allocated memory is still 183.5MB. Free memory was 131.7MB in the beginning and 121.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-08-18 16:53:06,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.01ms. Allocated memory is still 183.5MB. Free memory was 121.2MB in the beginning and 119.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-08-18 16:53:06,106 INFO L158 Benchmark]: Boogie Preprocessor took 23.77ms. Allocated memory is still 183.5MB. Free memory was 119.5MB in the beginning and 118.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-08-18 16:53:06,107 INFO L158 Benchmark]: RCFGBuilder took 331.24ms. Allocated memory is still 183.5MB. Free memory was 118.1MB in the beginning and 106.2MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-08-18 16:53:06,107 INFO L158 Benchmark]: BuchiAutomizer took 2335.01ms. Allocated memory was 183.5MB in the beginning and 267.4MB in the end (delta: 83.9MB). Free memory was 106.2MB in the beginning and 97.0MB in the end (delta: 9.2MB). Peak memory consumption was 94.2MB. Max. memory is 8.0GB. [2023-08-18 16:53:06,110 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 183.5MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.08ms. Allocated memory is still 183.5MB. Free memory was 131.7MB in the beginning and 121.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.01ms. Allocated memory is still 183.5MB. Free memory was 121.2MB in the beginning and 119.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.77ms. Allocated memory is still 183.5MB. Free memory was 119.5MB in the beginning and 118.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 331.24ms. Allocated memory is still 183.5MB. Free memory was 118.1MB in the beginning and 106.2MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2335.01ms. Allocated memory was 183.5MB in the beginning and 267.4MB in the end (delta: 83.9MB). Free memory was 106.2MB in the beginning and 97.0MB in the end (delta: 9.2MB). Peak memory consumption was 94.2MB. 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 6 locations. One deterministic module has affine ranking function 19999 + -2 * x2 and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 43 StatesRemovedByMinimization, 1 NontrivialMinimizations. 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, 174 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 157 mSDtfsCounter, 51 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 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-08-18 16:53:06,125 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 [2023-08-18 16:53:06,320 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 [2023-08-18 16:53:06,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...