/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/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:20:46,668 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:20:46,711 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 11:20:46,742 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:20:46,743 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:20:46,743 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:20:46,745 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:20:46,745 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:20:46,745 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:20:46,748 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:20:46,748 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:20:46,748 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:20:46,749 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:20:46,750 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:20:46,750 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:20:46,750 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:20:46,750 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:20:46,751 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:20:46,751 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:20:46,751 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:20:46,751 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:20:46,751 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:20:46,752 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:20:46,752 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:20:46,753 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:20:46,753 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:20:46,753 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:20:46,753 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:20:46,753 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:20:46,753 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:20:46,754 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:20:46,754 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:20:46,754 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:20:46,754 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:20:46,755 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:20:46,756 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> NONE [2023-09-17 11:20:46,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:20:46,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:20:46,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:20:46,916 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:20:46,916 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:20:46,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-09-17 11:20:47,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:20:48,064 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:20:48,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-09-17 11:20:48,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8130c7f2/ddabff6cac78438fbdef7908fbf13d37/FLAG18e13a2d8 [2023-09-17 11:20:48,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8130c7f2/ddabff6cac78438fbdef7908fbf13d37 [2023-09-17 11:20:48,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:20:48,083 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:20:48,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:20:48,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:20:48,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:20:48,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eef7fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48, skipping insertion in model container [2023-09-17 11:20:48,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:20:48,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:20:48,246 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/popl20-bad-counter-queue.wvr.c[2382,2395] [2023-09-17 11:20:48,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:20:48,258 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:20:48,270 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/popl20-bad-counter-queue.wvr.c[2382,2395] [2023-09-17 11:20:48,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:20:48,278 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:20:48,278 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:20:48,282 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:20:48,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48 WrapperNode [2023-09-17 11:20:48,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:20:48,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:20:48,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:20:48,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:20:48,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,311 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2023-09-17 11:20:48,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:20:48,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:20:48,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:20:48,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:20:48,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:20:48,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:20:48,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:20:48,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:20:48,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (1/1) ... [2023-09-17 11:20:48,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:48,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:48,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:48,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-09-17 11:20:48,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:20:48,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:20:48,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:20:48,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-17 11:20:48,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 11:20:48,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 11:20:48,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 11:20:48,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 11:20:48,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:20:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:20:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:20:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-17 11:20:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:20:48,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:20:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:20:48,392 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 11:20:48,485 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:20:48,487 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:20:48,648 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:20:48,754 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:20:48,754 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-17 11:20:48,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:20:48 BoogieIcfgContainer [2023-09-17 11:20:48,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:20:48,756 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:20:48,756 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:20:48,759 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:20:48,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:20:48,760 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:20:48" (1/3) ... [2023-09-17 11:20:48,760 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33e66be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:20:48, skipping insertion in model container [2023-09-17 11:20:48,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:20:48,760 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:20:48" (2/3) ... [2023-09-17 11:20:48,761 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33e66be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:20:48, skipping insertion in model container [2023-09-17 11:20:48,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:20:48,761 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:20:48" (3/3) ... [2023-09-17 11:20:48,762 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-09-17 11:20:48,815 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:20:48,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 103 transitions, 216 flow [2023-09-17 11:20:48,877 INFO L124 PetriNetUnfolderBase]: 9/99 cut-off events. [2023-09-17 11:20:48,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:20:48,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 99 events. 9/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-09-17 11:20:48,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 103 transitions, 216 flow [2023-09-17 11:20:48,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 204 flow [2023-09-17 11:20:48,902 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:20:48,902 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:20:48,902 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:20:48,902 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:20:48,902 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:20:48,903 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:20:48,903 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:20:48,903 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:20:48,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-17 11:20:49,067 INFO L131 ngComponentsAnalysis]: Automaton has 151 accepting balls. 1387 [2023-09-17 11:20:49,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:20:49,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:20:49,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:20:49,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:20:49,075 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:20:49,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1710 states, but on-demand construction may add more states [2023-09-17 11:20:49,093 INFO L131 ngComponentsAnalysis]: Automaton has 151 accepting balls. 1387 [2023-09-17 11:20:49,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:20:49,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:20:49,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:20:49,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:20:49,107 INFO L748 eck$LassoCheckResult]: Stem: 102#[$Ultimate##0]don't care [292] $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] 105#[L-1]don't care [300] L-1-->L-1-1: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 107#[L-1-1]don't care [332] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 109#[L21]don't care [291] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 111#[L21-1]don't care [314] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_9| 1) 0)) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 113#[L21-2]don't care [311] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_10| 1) 1) 0) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 115#[L21-3]don't care [270] L21-3-->L21-4: Formula: (and (= (select |v_#length_9| 2) 31) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 117#[L21-4]don't care [341] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 119#[L42]don't care [329] L42-->L42-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 121#[L42-1]don't care [317] L42-1-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 123#[L-1-2]don't care [333] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 125#[L-1-3]don't care [337] L-1-3-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret8#1.base] 127#[L75]don't care [334] L75-->L75-1: Formula: (and (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_10|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_#valid_15| (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 129#[L75-1]don't care [290] L75-1-->L75-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 131#[L75-2]don't care [313] L75-2-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 133#[L77]don't care [261] L77-->L77-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 135#[L77-1]don't care [273] L77-1-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 137#[L78]don't care [276] L78-->L78-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 139#[L78-1]don't care [280] L78-1-->L78-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 141#[L78-2]don't care [307] L78-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post14#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] 143#[L90]don't care [325] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 145#[L91]don't care [281] L91-->L91-1: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 147#[L91-1]don't care [295] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 149#[L37]don't care [330] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 151#[L38]don't care [343] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[] 155#[L37-1]don't care [331] L37-1-->L92: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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] 157#[L92]don't care [304] L92-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 159#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|) 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_4|, 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] 161#[L38-3]don't care [297] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[] 165#[L37-3]don't care [293] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 167#[L94]don't care [318] L94-->L94-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, #valid=|v_#valid_3|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 169#[L94-1]don't care [263] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 171#[L94-2]don't care [298] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 173#[L95]don't care [274] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 175#[L95-6]don't care [2023-09-17 11:20:49,111 INFO L750 eck$LassoCheckResult]: Loop: 175#[L95-6]don't care [255] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 179#[L96]don't care [305] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1] 183#[L96-1]don't care [249] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|)) |v_#memory_int_3|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[#memory_int] 187#[L96-2]don't care [279] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1] 191#[L95-3]don't care [312] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post14#1] 195#[L95-4]don't care [308] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 199#[L95-5]don't care [248] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post14#1] 175#[L95-6]don't care [2023-09-17 11:20:49,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1542133329, now seen corresponding path program 1 times [2023-09-17 11:20:49,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:49,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791062982] [2023-09-17 11:20:49,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:49,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:49,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:49,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:49,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash 803516811, now seen corresponding path program 1 times [2023-09-17 11:20:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902113375] [2023-09-17 11:20:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:49,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:49,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:49,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1976754491, now seen corresponding path program 1 times [2023-09-17 11:20:49,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:49,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118465964] [2023-09-17 11:20:49,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:49,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:49,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:50,081 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:20:50,081 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:20:50,081 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:20:50,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:20:50,083 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:20:50,083 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:50,083 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:20:50,083 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:20:50,083 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration1_Lasso [2023-09-17 11:20:50,083 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:20:50,083 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:20:50,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:50,868 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:20:50,871 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:20:50,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:50,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:50,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-09-17 11:20:50,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:50,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:50,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:50,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:50,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:50,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:50,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:50,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:50,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:50,924 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-09-17 11:20:50,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:50,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:50,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:50,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-09-17 11:20:50,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:50,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:50,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:50,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:50,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:50,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:50,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:50,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:50,961 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-09-17 11:20:50,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:50,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:50,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-09-17 11:20:50,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:50,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:50,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:50,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:50,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:50,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:50,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:50,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:50,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:50,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:50,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:50,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-09-17 11:20:51,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-09-17 11:20:51,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,073 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-09-17 11:20:51,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-09-17 11:20:51,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,155 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-09-17 11:20:51,158 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-09-17 11:20:51,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,188 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-09-17 11:20:51,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,190 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-09-17 11:20:51,192 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-09-17 11:20:51,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:51,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:51,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:51,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,220 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-09-17 11:20:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,221 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-09-17 11:20:51,226 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-09-17 11:20:51,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:51,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:51,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:51,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,255 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-09-17 11:20:51,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,257 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-09-17 11:20:51,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,281 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-09-17 11:20:51,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,294 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-09-17 11:20:51,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,296 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-09-17 11:20:51,299 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-09-17 11:20:51,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,331 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-09-17 11:20:51,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,333 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-09-17 11:20:51,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:51,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:51,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:51,349 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-09-17 11:20:51,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,363 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-09-17 11:20:51,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,364 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-09-17 11:20:51,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:51,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:51,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:51,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,396 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-09-17 11:20:51,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,424 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-09-17 11:20:51,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,499 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-09-17 11:20:51,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,564 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-09-17 11:20:51,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,575 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-09-17 11:20:51,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,578 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2023-09-17 11:20:51,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:51,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,618 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-09-17 11:20:51,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:51,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:51,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:51,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:51,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:51,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:51,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:51,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:20:51,707 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-09-17 11:20:51,707 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-09-17 11:20:51,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:51,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:51,766 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:51,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-09-17 11:20:51,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:20:51,778 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-17 11:20:51,778 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:20:51,779 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2023-09-17 11:20:51,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:51,826 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2023-09-17 11:20:51,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:20:51,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-17 11:20:51,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:20:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:20:51,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-17 11:20:51,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:20:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:20:51,998 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-09-17 11:20:52,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 1710 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:52,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 1710 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 3474 states and 10558 transitions. Complement of second has 9 states. [2023-09-17 11:20:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-17 11:20:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2023-09-17 11:20:52,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 167 transitions. Stem has 34 letters. Loop has 7 letters. [2023-09-17 11:20:52,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:20:52,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 167 transitions. Stem has 41 letters. Loop has 7 letters. [2023-09-17 11:20:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:20:52,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 167 transitions. Stem has 34 letters. Loop has 14 letters. [2023-09-17 11:20:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:20:52,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3474 states and 10558 transitions. [2023-09-17 11:20:52,183 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 708 [2023-09-17 11:20:52,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3474 states to 840 states and 2267 transitions. [2023-09-17 11:20:52,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 831 [2023-09-17 11:20:52,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 833 [2023-09-17 11:20:52,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 840 states and 2267 transitions. [2023-09-17 11:20:52,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:20:52,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 840 states and 2267 transitions. [2023-09-17 11:20:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states and 2267 transitions. [2023-09-17 11:20:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 839. [2023-09-17 11:20:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 839 states have (on average 2.700834326579261) internal successors, (2266), 838 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2266 transitions. [2023-09-17 11:20:52,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 839 states and 2266 transitions. [2023-09-17 11:20:52,251 INFO L428 stractBuchiCegarLoop]: Abstraction has 839 states and 2266 transitions. [2023-09-17 11:20:52,251 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:20:52,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 839 states and 2266 transitions. [2023-09-17 11:20:52,255 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 708 [2023-09-17 11:20:52,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:20:52,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:20:52,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:20:52,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-17 11:20:52,257 INFO L748 eck$LassoCheckResult]: Stem: 8007#[$Ultimate##0]don't care [292] $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] 8009#[L-1]don't care [300] L-1-->L-1-1: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 8675#[L-1-1]don't care [332] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 8677#[L21]don't care [291] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 8813#[L21-1]don't care [314] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_9| 1) 0)) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 8091#[L21-2]don't care [311] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_10| 1) 1) 0) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 8093#[L21-3]don't care [270] L21-3-->L21-4: Formula: (and (= (select |v_#length_9| 2) 31) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 8721#[L21-4]don't care [341] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 8419#[L42]don't care [329] L42-->L42-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 8421#[L42-1]don't care [317] L42-1-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 8883#[L-1-2]don't care [333] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 8817#[L-1-3]don't care [337] L-1-3-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret8#1.base] 8819#[L75]don't care [334] L75-->L75-1: Formula: (and (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_10|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_#valid_15| (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 8765#[L75-1]don't care [290] L75-1-->L75-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 7789#[L75-2]don't care [313] L75-2-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 7791#[L77]don't care [261] L77-->L77-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 8147#[L77-1]don't care [273] L77-1-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 8325#[L78]don't care [276] L78-->L78-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 8327#[L78-1]don't care [280] L78-1-->L78-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 8083#[L78-2]don't care [307] L78-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post14#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] 8085#[L90]don't care [325] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 8753#[L91]don't care [281] L91-->L91-1: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8755#[L91-1]don't care [295] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 7499#[L37]don't care [330] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 7501#[L38]don't care [343] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[] 8625#[L37-1]don't care [331] L37-1-->L92: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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] 8627#[L92]don't care [304] L92-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 8583#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|) 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_4|, 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] 7393#[L38-3]don't care [297] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[] 7395#[L37-3]don't care [293] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 7805#[L94]don't care [318] L94-->L94-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, #valid=|v_#valid_3|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 7597#[L94-1]don't care [263] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 7599#[L94-2]don't care [298] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 7741#[L95]don't care [274] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 8173#[L95-6]don't care [256] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[] 7943#[L95-7]don't care [269] L95-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 7945#[create_fresh_int_array_returnLabel#1]don't care [309] create_fresh_int_array_returnLabel#1-->L78-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 8739#[L78-3]don't care [253] L78-3-->L78-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 8707#[L78-4]don't care [301] L78-4-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 8251#[L81]don't care [327] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 8253#[L81-1]don't care [258] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 8659#[L81-2]don't care [286] L81-2-->L81-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre9#1_2|)) |v_#memory_int_5|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, 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|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, 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|} AuxVars[] AssignedVars[#memory_int] 8143#[L81-3]don't care [373] L81-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~tmp~0#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 8145#[L81-4, $Ultimate##0]don't care [346] $Ultimate##0-->L49-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 7809#[L81-4, L49-4]don't care [2023-09-17 11:20:52,257 INFO L750 eck$LassoCheckResult]: Loop: 7809#[L81-4, L49-4]don't care [347] L49-4-->L50: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_3| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_3|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_3|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 8597#[L81-4, L50]don't care [350] L50-->L52: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork1_~i~0#1_7| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_23)) (.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 .cse0) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_29| v_~A~0.base_23) .cse0)) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| v_~counter~0_27) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (<= (+ .cse1 v_~A~0.offset_23 4) (select |v_#length_32| v_~A~0.base_23)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (or (<= .cse2 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| |v_thread1Thread1of1ForFork1_~tmp~0#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| |v_thread1Thread1of1ForFork1_plus_~a#1_1|) (= .cse2 |v_thread1Thread1of1ForFork1_plus_#res#1_1|) (= (select |v_#valid_37| v_~A~0.base_23) 1)))) InVars {~counter~0=v_~counter~0_27, ~A~0.base=v_~A~0.base_23, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|} OutVars{thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_1|, ~counter~0=v_~counter~0_27, ~A~0.base=v_~A~0.base_23, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_1|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~tmp~0#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 8601#[L81-4, L52]don't care [352] L52-->L55: Formula: (= v_~counter~0_2 |v_thread1Thread1of1ForFork1_~tmp~0#1_3|) InVars {thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_3|} OutVars{thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_3|, ~counter~0=v_~counter~0_2} AuxVars[] AssignedVars[~counter~0] 8851#[L81-4, L55]don't care [354] L55-->L49-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_9|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 8853#[L81-4, L49-2]don't care [355] L49-2-->L49-3: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_11| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_11|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 7807#[L81-4, L49-3]don't care [356] L49-3-->L49-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 7809#[L81-4, L49-4]don't care [2023-09-17 11:20:52,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1236140321, now seen corresponding path program 1 times [2023-09-17 11:20:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:52,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218869543] [2023-09-17 11:20:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:52,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:52,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:52,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:52,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1729012473, now seen corresponding path program 1 times [2023-09-17 11:20:52,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:52,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975239351] [2023-09-17 11:20:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:52,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:52,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:52,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:52,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash -350091737, now seen corresponding path program 1 times [2023-09-17 11:20:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187663260] [2023-09-17 11:20:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:20:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:20:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:20:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187663260] [2023-09-17 11:20:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187663260] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:20:52,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:20:52,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-17 11:20:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627591107] [2023-09-17 11:20:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:20:52,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:52,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:20:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-17 11:20:52,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-17 11:20:52,714 INFO L87 Difference]: Start difference. First operand 839 states and 2266 transitions. cyclomatic complexity: 1506 Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:20:52,821 INFO L93 Difference]: Finished difference Result 1210 states and 3196 transitions. [2023-09-17 11:20:52,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1210 states and 3196 transitions. [2023-09-17 11:20:52,830 INFO L131 ngComponentsAnalysis]: Automaton has 118 accepting balls. 948 [2023-09-17 11:20:52,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1210 states to 1162 states and 3082 transitions. [2023-09-17 11:20:52,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1150 [2023-09-17 11:20:52,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1150 [2023-09-17 11:20:52,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1162 states and 3082 transitions. [2023-09-17 11:20:52,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:20:52,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1162 states and 3082 transitions. [2023-09-17 11:20:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states and 3082 transitions. [2023-09-17 11:20:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 971. [2023-09-17 11:20:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 971 states have (on average 2.698249227600412) internal successors, (2620), 970 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2620 transitions. [2023-09-17 11:20:52,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 971 states and 2620 transitions. [2023-09-17 11:20:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-17 11:20:52,872 INFO L428 stractBuchiCegarLoop]: Abstraction has 971 states and 2620 transitions. [2023-09-17 11:20:52,872 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-09-17 11:20:52,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 971 states and 2620 transitions. [2023-09-17 11:20:52,876 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 804 [2023-09-17 11:20:52,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:20:52,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:20:52,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:20:52,878 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-17 11:20:52,879 INFO L748 eck$LassoCheckResult]: Stem: 10931#[$Ultimate##0]don't care [292] $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] 10933#[L-1]don't care [300] L-1-->L-1-1: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 11627#[L-1-1]don't care [332] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 11629#[L21]don't care [291] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 11811#[L21-1]don't care [314] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_9| 1) 0)) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 11023#[L21-2]don't care [311] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_10| 1) 1) 0) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 11025#[L21-3]don't care [270] L21-3-->L21-4: Formula: (and (= (select |v_#length_9| 2) 31) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 11693#[L21-4]don't care [341] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 11357#[L42]don't care [329] L42-->L42-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 11359#[L42-1]don't care [317] L42-1-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 11913#[L-1-2]don't care [333] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 11825#[L-1-3]don't care [337] L-1-3-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret8#1.base] 11827#[L75]don't care [334] L75-->L75-1: Formula: (and (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_10|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_#valid_15| (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 11751#[L75-1]don't care [290] L75-1-->L75-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 10699#[L75-2]don't care [313] L75-2-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 10701#[L77]don't care [261] L77-->L77-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 11083#[L77-1]don't care [273] L77-1-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 11263#[L78]don't care [276] L78-->L78-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 11265#[L78-1]don't care [280] L78-1-->L78-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 11019#[L78-2]don't care [307] L78-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post14#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] 11021#[L90]don't care [325] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 11735#[L91]don't care [281] L91-->L91-1: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 11737#[L91-1]don't care [295] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 10399#[L37]don't care [330] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 10401#[L38]don't care [343] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[] 11569#[L37-1]don't care [331] L37-1-->L92: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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] 11571#[L92]don't care [304] L92-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 11519#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|) 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_4|, 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] 10297#[L38-3]don't care [297] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[] 10299#[L37-3]don't care [293] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 10721#[L94]don't care [318] L94-->L94-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, #valid=|v_#valid_3|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 10487#[L94-1]don't care [263] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 10489#[L94-2]don't care [298] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 10647#[L95]don't care [274] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 11109#[L95-6]don't care [256] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[] 10855#[L95-7]don't care [269] L95-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 10857#[create_fresh_int_array_returnLabel#1]don't care [309] create_fresh_int_array_returnLabel#1-->L78-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 11713#[L78-3]don't care [253] L78-3-->L78-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 11673#[L78-4]don't care [301] L78-4-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 11185#[L81]don't care [327] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 11187#[L81-1]don't care [258] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 11607#[L81-2]don't care [286] L81-2-->L81-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre9#1_2|)) |v_#memory_int_5|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, 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|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, 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|} AuxVars[] AssignedVars[#memory_int] 11079#[L81-3]don't care [373] L81-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~tmp~0#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 11081#[L81-4, $Ultimate##0]don't care [299] L81-4-->L81-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 11193#[L81-5, $Ultimate##0]don't care [259] L81-5-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 11599#[L82, $Ultimate##0]don't care [282] L82-->L82-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 10633#[L82-1, $Ultimate##0]don't care [264] L82-1-->L82-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 10635#[$Ultimate##0, L82-2]don't care [335] L82-2-->L82-3: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|))) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_7|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 11553#[L82-3, $Ultimate##0]don't care [370] L82-3-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_4|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_8|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~ret6#1] 11555#[$Ultimate##0, $Ultimate##0, L82-4]don't care [357] $Ultimate##0-->L62-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 10321#[L62-4, $Ultimate##0, L82-4]don't care [2023-09-17 11:20:52,880 INFO L750 eck$LassoCheckResult]: Loop: 10321#[L62-4, $Ultimate##0, L82-4]don't care [358] L62-4-->L63: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N~0_4) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[] 11399#[L63, $Ultimate##0, L82-4]don't care [361] L63-->L65: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_7| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_25))) (and (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~a#1_1| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_1|)) (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_1|)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (<= 0 .cse0) (= |v_thread2Thread1of1ForFork0_minus_#res#1_1| |v_thread2Thread1of1ForFork0_~tmp~1#1_1|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_1| v_~counter~0_29) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_1| 0) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_1| (+ |v_thread2Thread1of1ForFork0_minus_~a#1_1| 2147483648))) 1 0) 0)) (= (select (select |v_#memory_int_31| v_~A~0.base_25) .cse0) |v_thread2Thread1of1ForFork0_minus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_1| |v_thread2Thread1of1ForFork0_minus_~b#1_1|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_1| |v_thread2Thread1of1ForFork0_minus_~a#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (select |v_#valid_39| v_~A~0.base_25) 1) (<= (+ .cse1 v_~A~0.offset_25 4) (select |v_#length_34| v_~A~0.base_25)) (= (+ |v_thread2Thread1of1ForFork0_minus_#res#1_1| |v_thread2Thread1of1ForFork0_minus_~b#1_1|) |v_thread2Thread1of1ForFork0_minus_~a#1_1|)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_25, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_7|, #length=|v_#length_34|} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_25, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_7|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_25, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_1|, #valid=|v_#valid_39|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_1|, #memory_int=|v_#memory_int_31|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_1|, #length=|v_#length_34|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 10907#[$Ultimate##0, L82-4, L65]don't care [363] L65-->L68: Formula: (= v_~counter~0_3 |v_thread2Thread1of1ForFork0_~tmp~1#1_3|) InVars {thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_3|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_3|, ~counter~0=v_~counter~0_3} AuxVars[] AssignedVars[~counter~0] 10909#[$Ultimate##0, L82-4, L68]don't care [365] L68-->L62-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_9| |v_thread2Thread1of1ForFork0_#t~post4#1_1|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post4#1] 11671#[L62-2, $Ultimate##0, L82-4]don't care [366] L62-2-->L62-3: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_11| (+ |v_thread2Thread1of1ForFork0_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 10315#[$Ultimate##0, L82-4, L62-3]don't care [367] L62-3-->L62-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post4#1] 10321#[L62-4, $Ultimate##0, L82-4]don't care [2023-09-17 11:20:52,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1697895901, now seen corresponding path program 1 times [2023-09-17 11:20:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615862018] [2023-09-17 11:20:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:52,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:52,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:52,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:52,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:52,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1403594457, now seen corresponding path program 1 times [2023-09-17 11:20:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:52,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377347608] [2023-09-17 11:20:52,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:52,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:52,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:52,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:52,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash -898670135, now seen corresponding path program 1 times [2023-09-17 11:20:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:52,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007803852] [2023-09-17 11:20:52,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:20:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:20:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:20:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007803852] [2023-09-17 11:20:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007803852] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:20:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:20:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-17 11:20:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123359360] [2023-09-17 11:20:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:20:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:20:53,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-17 11:20:53,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-17 11:20:53,258 INFO L87 Difference]: Start difference. First operand 971 states and 2620 transitions. cyclomatic complexity: 1744 Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:20:53,330 INFO L93 Difference]: Finished difference Result 962 states and 2507 transitions. [2023-09-17 11:20:53,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 962 states and 2507 transitions. [2023-09-17 11:20:53,336 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 708 [2023-09-17 11:20:53,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 962 states to 844 states and 2270 transitions. [2023-09-17 11:20:53,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 832 [2023-09-17 11:20:53,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 832 [2023-09-17 11:20:53,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 844 states and 2270 transitions. [2023-09-17 11:20:53,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:20:53,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 844 states and 2270 transitions. [2023-09-17 11:20:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states and 2270 transitions. [2023-09-17 11:20:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 839. [2023-09-17 11:20:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 839 states have (on average 2.699642431466031) internal successors, (2265), 838 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2265 transitions. [2023-09-17 11:20:53,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 839 states and 2265 transitions. [2023-09-17 11:20:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-17 11:20:53,386 INFO L428 stractBuchiCegarLoop]: Abstraction has 839 states and 2265 transitions. [2023-09-17 11:20:53,386 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-09-17 11:20:53,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 839 states and 2265 transitions. [2023-09-17 11:20:53,391 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 708 [2023-09-17 11:20:53,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:20:53,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:20:53,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:20:53,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-17 11:20:53,393 INFO L748 eck$LassoCheckResult]: Stem: 13839#[$Ultimate##0]don't care [292] $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] 13841#[L-1]don't care [300] L-1-->L-1-1: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 14507#[L-1-1]don't care [332] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 14509#[L21]don't care [291] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 14645#[L21-1]don't care [314] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_9| 1) 0)) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 13923#[L21-2]don't care [311] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_10| 1) 1) 0) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 13925#[L21-3]don't care [270] L21-3-->L21-4: Formula: (and (= (select |v_#length_9| 2) 31) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 14553#[L21-4]don't care [341] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 14251#[L42]don't care [329] L42-->L42-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 14253#[L42-1]don't care [317] L42-1-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 14715#[L-1-2]don't care [333] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 14649#[L-1-3]don't care [337] L-1-3-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret8#1.base] 14651#[L75]don't care [334] L75-->L75-1: Formula: (and (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_10|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_#valid_15| (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 14597#[L75-1]don't care [290] L75-1-->L75-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 13621#[L75-2]don't care [313] L75-2-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 13623#[L77]don't care [261] L77-->L77-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 13979#[L77-1]don't care [273] L77-1-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 14157#[L78]don't care [276] L78-->L78-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 14159#[L78-1]don't care [280] L78-1-->L78-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 13915#[L78-2]don't care [307] L78-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post14#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] 13917#[L90]don't care [325] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 14585#[L91]don't care [281] L91-->L91-1: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 14587#[L91-1]don't care [295] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 13331#[L37]don't care [330] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 13333#[L38]don't care [343] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[] 14457#[L37-1]don't care [331] L37-1-->L92: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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] 14459#[L92]don't care [304] L92-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 14415#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|) 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_4|, 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] 13225#[L38-3]don't care [297] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[] 13227#[L37-3]don't care [293] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13643#[L94]don't care [318] L94-->L94-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, #valid=|v_#valid_3|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 13419#[L94-1]don't care [263] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 13421#[L94-2]don't care [298] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 13573#[L95]don't care [274] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 14005#[L95-6]don't care [255] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 14621#[L96]don't care [305] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1] 14619#[L96-1]don't care [249] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|)) |v_#memory_int_3|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[#memory_int] 13809#[L96-2]don't care [279] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1] 13811#[L95-3]don't care [312] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post14#1] 14069#[L95-4]don't care [308] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 13039#[L95-5]don't care [248] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post14#1] 13043#[L95-6]don't care [256] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[] 13775#[L95-7]don't care [269] L95-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 13777#[create_fresh_int_array_returnLabel#1]don't care [309] create_fresh_int_array_returnLabel#1-->L78-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 14571#[L78-3]don't care [253] L78-3-->L78-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 14539#[L78-4]don't care [301] L78-4-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 14083#[L81]don't care [327] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 14085#[L81-1]don't care [258] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 14491#[L81-2]don't care [286] L81-2-->L81-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre9#1_2|)) |v_#memory_int_5|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, 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|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, 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|} AuxVars[] AssignedVars[#memory_int] 13975#[L81-3]don't care [373] L81-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~tmp~0#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 13977#[L81-4, $Ultimate##0]don't care [346] $Ultimate##0-->L49-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 13639#[L81-4, L49-4]don't care [2023-09-17 11:20:53,393 INFO L750 eck$LassoCheckResult]: Loop: 13639#[L81-4, L49-4]don't care [347] L49-4-->L50: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_3| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_3|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_3|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 14429#[L81-4, L50]don't care [350] L50-->L52: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork1_~i~0#1_7| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_23)) (.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 .cse0) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_29| v_~A~0.base_23) .cse0)) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| v_~counter~0_27) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (<= (+ .cse1 v_~A~0.offset_23 4) (select |v_#length_32| v_~A~0.base_23)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (or (<= .cse2 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| |v_thread1Thread1of1ForFork1_~tmp~0#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| |v_thread1Thread1of1ForFork1_plus_~a#1_1|) (= .cse2 |v_thread1Thread1of1ForFork1_plus_#res#1_1|) (= (select |v_#valid_37| v_~A~0.base_23) 1)))) InVars {~counter~0=v_~counter~0_27, ~A~0.base=v_~A~0.base_23, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|} OutVars{thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_1|, ~counter~0=v_~counter~0_27, ~A~0.base=v_~A~0.base_23, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_1|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_29|, #length=|v_#length_32|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~tmp~0#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 14433#[L81-4, L52]don't care [352] L52-->L55: Formula: (= v_~counter~0_2 |v_thread1Thread1of1ForFork1_~tmp~0#1_3|) InVars {thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_3|} OutVars{thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_3|, ~counter~0=v_~counter~0_2} AuxVars[] AssignedVars[~counter~0] 14683#[L81-4, L55]don't care [354] L55-->L49-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_9|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 14685#[L81-4, L49-2]don't care [355] L49-2-->L49-3: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_11| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_11|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 13637#[L81-4, L49-3]don't care [356] L49-3-->L49-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 13639#[L81-4, L49-4]don't care [2023-09-17 11:20:53,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash -51597429, now seen corresponding path program 1 times [2023-09-17 11:20:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310927633] [2023-09-17 11:20:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:53,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:53,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:53,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1729012473, now seen corresponding path program 2 times [2023-09-17 11:20:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312481153] [2023-09-17 11:20:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:53,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:53,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:53,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash 461028625, now seen corresponding path program 1 times [2023-09-17 11:20:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:53,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769446766] [2023-09-17 11:20:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:53,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:53,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:54,573 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:20:54,574 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:20:54,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:20:54,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:20:54,574 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:20:54,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:54,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:20:54,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:20:54,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration4_Lasso [2023-09-17 11:20:54,574 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:20:54,574 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:20:54,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:54,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:55,376 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:20:55,376 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:20:55,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,393 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-09-17 11:20:55,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,450 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-09-17 11:20:55,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:55,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:55,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:55,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,481 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-09-17 11:20:55,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:55,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:55,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:55,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,512 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-09-17 11:20:55,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:55,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:55,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:55,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,550 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-09-17 11:20:55,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:55,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:55,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:55,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,579 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-09-17 11:20:55,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,595 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-09-17 11:20:55,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:55,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:55,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:55,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,613 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-09-17 11:20:55,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,643 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-09-17 11:20:55,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,662 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-09-17 11:20:55,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,680 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-09-17 11:20:55,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,689 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-09-17 11:20:55,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,722 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-09-17 11:20:55,722 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-09-17 11:20:55,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-09-17 11:20:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,750 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-09-17 11:20:55,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-09-17 11:20:55,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,767 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-09-17 11:20:55,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,776 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-09-17 11:20:55,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,779 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2023-09-17 11:20:55,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-09-17 11:20:55,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,804 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-09-17 11:20:55,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,845 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-09-17 11:20:55,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-09-17 11:20:55,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,878 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-09-17 11:20:55,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,924 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-09-17 11:20:55,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:55,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,980 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:55,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-09-17 11:20:55,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:55,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:55,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:55,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:55,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:55,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:55,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:55,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:55,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-09-17 11:20:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:55,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:55,998 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:56,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:56,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:56,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:56,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:56,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:56,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:56,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:56,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-09-17 11:20:56,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:56,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-09-17 11:20:56,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:56,028 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:56,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-09-17 11:20:56,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:56,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:56,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:56,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:56,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:56,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:56,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:56,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:56,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:56,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:56,072 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:56,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-09-17 11:20:56,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:56,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:56,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:56,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:56,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:56,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:56,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:56,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:56,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:56,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:56,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:56,105 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:56,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-09-17 11:20:56,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:56,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:56,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:56,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:56,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:56,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:56,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:56,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:56,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:56,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:56,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:56,130 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:56,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-09-17 11:20:56,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:56,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:56,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:56,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:56,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:56,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:56,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:56,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:56,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:56,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:56,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:56,148 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:56,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-09-17 11:20:56,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:56,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:56,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:56,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:56,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:56,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:56,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:56,172 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:20:56,193 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-09-17 11:20:56,193 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2023-09-17 11:20:56,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:56,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:56,194 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:56,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-09-17 11:20:56,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:20:56,219 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-09-17 11:20:56,219 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:20:56,219 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~A~0.base)_1, thread1Thread1of1ForFork1_~i~0#1) = 1*v_rep(select #length ~A~0.base)_1 - 4*thread1Thread1of1ForFork1_~i~0#1 Supporting invariants [1*~A~0.offset >= 0] [2023-09-17 11:20:56,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:56,272 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2023-09-17 11:20:56,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:20:56,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-17 11:20:56,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:20:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:20:56,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-17 11:20:56,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:20:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:20:56,493 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2023-09-17 11:20:56,493 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 839 states and 2265 transitions. cyclomatic complexity: 1505 Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:56,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 839 states and 2265 transitions. cyclomatic complexity: 1505. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 2028 states and 6192 transitions. Complement of second has 14 states. [2023-09-17 11:20:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-17 11:20:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2023-09-17 11:20:56,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 178 transitions. Stem has 51 letters. Loop has 6 letters. [2023-09-17 11:20:56,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:20:56,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 178 transitions. Stem has 57 letters. Loop has 6 letters. [2023-09-17 11:20:56,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:20:56,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 178 transitions. Stem has 51 letters. Loop has 12 letters. [2023-09-17 11:20:56,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:20:56,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2028 states and 6192 transitions. [2023-09-17 11:20:56,703 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 480 [2023-09-17 11:20:56,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2028 states to 1410 states and 4255 transitions. [2023-09-17 11:20:56,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 723 [2023-09-17 11:20:56,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 970 [2023-09-17 11:20:56,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1410 states and 4255 transitions. [2023-09-17 11:20:56,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:20:56,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1410 states and 4255 transitions. [2023-09-17 11:20:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states and 4255 transitions. [2023-09-17 11:20:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1165. [2023-09-17 11:20:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1165 states have (on average 3.0111587982832617) internal successors, (3508), 1164 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:20:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 3508 transitions. [2023-09-17 11:20:56,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1165 states and 3508 transitions. [2023-09-17 11:20:56,735 INFO L428 stractBuchiCegarLoop]: Abstraction has 1165 states and 3508 transitions. [2023-09-17 11:20:56,735 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-09-17 11:20:56,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1165 states and 3508 transitions. [2023-09-17 11:20:56,741 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 480 [2023-09-17 11:20:56,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:20:56,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:20:56,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:20:56,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-17 11:20:56,742 INFO L748 eck$LassoCheckResult]: Stem: 18416#[$Ultimate##0]don't care [292] $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] 18418#[L-1]don't care [300] L-1-->L-1-1: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 19338#[L-1-1]don't care [332] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 19242#[L21]don't care [291] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 18800#[L21-1]don't care [314] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_9| 1) 0)) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 18546#[L21-2]don't care [311] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_10| 1) 1) 0) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 18548#[L21-3]don't care [270] L21-3-->L21-4: Formula: (and (= (select |v_#length_9| 2) 31) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 17670#[L21-4]don't care [341] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 17672#[L42]don't care [329] L42-->L42-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 19168#[L42-1]don't care [317] L42-1-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 19378#[L-1-2]don't care [333] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 18926#[L-1-3]don't care [337] L-1-3-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret8#1.base] 18928#[L75]don't care [334] L75-->L75-1: Formula: (and (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_10|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_#valid_15| (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 18414#[L75-1]don't care [290] L75-1-->L75-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 18034#[L75-2]don't care [313] L75-2-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 18036#[L77]don't care [261] L77-->L77-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 18656#[L77-1]don't care [273] L77-1-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 19026#[L78]don't care [276] L78-->L78-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 17838#[L78-1]don't care [280] L78-1-->L78-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 17840#[L78-2]don't care [307] L78-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post14#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] 18520#[L90]don't care [325] L90-->L91: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 18348#[L91]don't care [281] L91-->L91-1: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 18350#[L91-1]don't care [295] L91-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 17626#[L37]don't care [330] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 17628#[L38]don't care [343] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[] 19350#[L37-1]don't care [331] L37-1-->L92: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, 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] 17996#[L92]don't care [304] L92-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 17998#[L37-2]don't care [271] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|) 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_4|, 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] 17424#[L38-3]don't care [297] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[] 17426#[L37-3]don't care [293] L37-3-->L94: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18048#[L94]don't care [318] L94-->L94-1: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_3|) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_1|, #valid=|v_#valid_3|, #length=|v_#length_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 17756#[L94-1]don't care [263] L94-1-->L94-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 17758#[L94-2]don't care [298] L94-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc13#1.base] 17962#[L95]don't care [274] L95-->L95-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 18688#[L95-6]don't care [255] L95-6-->L96: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 18618#[L96]don't care [305] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1] 18616#[L96-1]don't care [249] L96-1-->L96-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|)) |v_#memory_int_3|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_2|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[#memory_int] 18344#[L96-2]don't care [279] L96-2-->L95-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet15#1] 18346#[L95-3]don't care [312] L95-3-->L95-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post14#1] 18798#[L95-4]don't care [308] L95-4-->L95-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 17054#[L95-5]don't care [248] L95-5-->L95-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post14#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post14#1] 17056#[L95-6]don't care [256] L95-6-->L95-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[] 18302#[L95-7]don't care [269] L95-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 18304#[create_fresh_int_array_returnLabel#1]don't care [309] create_fresh_int_array_returnLabel#1-->L78-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 18184#[L78-3]don't care [253] L78-3-->L78-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 17502#[L78-4]don't care [301] L78-4-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 17504#[L81]don't care [327] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 18836#[L81-1]don't care [258] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 18960#[L81-2]don't care [286] L81-2-->L81-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre9#1_2|)) |v_#memory_int_5|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, 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|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, 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|} AuxVars[] AssignedVars[#memory_int] 18612#[L81-3]don't care [373] L81-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~tmp~0#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 18614#[L81-4, $Ultimate##0]don't care [299] L81-4-->L81-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 18522#[L81-5, $Ultimate##0]don't care [259] L81-5-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 18524#[L82, $Ultimate##0]don't care [282] L82-->L82-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 17942#[L82-1, $Ultimate##0]don't care [264] L82-1-->L82-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 17944#[$Ultimate##0, L82-2]don't care [335] L82-2-->L82-3: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|))) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_8|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_7|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 19334#[L82-3, $Ultimate##0]don't care [370] L82-3-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_4|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_8|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~ret6#1] 19156#[$Ultimate##0, $Ultimate##0, L82-4]don't care [357] $Ultimate##0-->L62-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 17512#[L62-4, $Ultimate##0, L82-4]don't care [2023-09-17 11:20:56,742 INFO L750 eck$LassoCheckResult]: Loop: 17512#[L62-4, $Ultimate##0, L82-4]don't care [358] L62-4-->L63: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N~0_4) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[] 19202#[L63, $Ultimate##0, L82-4]don't care [361] L63-->L65: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_7| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_25))) (and (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~a#1_1| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_1|)) (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_1|)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (<= 0 .cse0) (= |v_thread2Thread1of1ForFork0_minus_#res#1_1| |v_thread2Thread1of1ForFork0_~tmp~1#1_1|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_1| v_~counter~0_29) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_1| 0) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_1| (+ |v_thread2Thread1of1ForFork0_minus_~a#1_1| 2147483648))) 1 0) 0)) (= (select (select |v_#memory_int_31| v_~A~0.base_25) .cse0) |v_thread2Thread1of1ForFork0_minus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_1| |v_thread2Thread1of1ForFork0_minus_~b#1_1|) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_1| |v_thread2Thread1of1ForFork0_minus_~a#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (select |v_#valid_39| v_~A~0.base_25) 1) (<= (+ .cse1 v_~A~0.offset_25 4) (select |v_#length_34| v_~A~0.base_25)) (= (+ |v_thread2Thread1of1ForFork0_minus_#res#1_1| |v_thread2Thread1of1ForFork0_minus_~b#1_1|) |v_thread2Thread1of1ForFork0_minus_~a#1_1|)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_25, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_7|, #length=|v_#length_34|} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_25, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_7|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_25, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_1|, #valid=|v_#valid_39|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_1|, #memory_int=|v_#memory_int_31|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_1|, #length=|v_#length_34|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~ret6#1] 18374#[$Ultimate##0, L82-4, L65]don't care [363] L65-->L68: Formula: (= v_~counter~0_3 |v_thread2Thread1of1ForFork0_~tmp~1#1_3|) InVars {thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_3|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_3|, ~counter~0=v_~counter~0_3} AuxVars[] AssignedVars[~counter~0] 17494#[$Ultimate##0, L82-4, L68]don't care [365] L68-->L62-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_9| |v_thread2Thread1of1ForFork0_#t~post4#1_1|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post4#1] 17500#[L62-2, $Ultimate##0, L82-4]don't care [366] L62-2-->L62-3: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_11| (+ |v_thread2Thread1of1ForFork0_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 17506#[$Ultimate##0, L82-4, L62-3]don't care [367] L62-3-->L62-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post4#1] 17512#[L62-4, $Ultimate##0, L82-4]don't care [2023-09-17 11:20:56,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash -886775539, now seen corresponding path program 1 times [2023-09-17 11:20:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:56,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957541657] [2023-09-17 11:20:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:56,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:56,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:56,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:56,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1403594457, now seen corresponding path program 2 times [2023-09-17 11:20:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:56,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972948220] [2023-09-17 11:20:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:56,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:56,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:56,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:20:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1633272115, now seen corresponding path program 1 times [2023-09-17 11:20:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:20:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420596959] [2023-09-17 11:20:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:20:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:20:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:56,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:20:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:20:56,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:20:57,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-09-17 11:20:57,973 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:20:57,973 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:20:57,973 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:20:57,973 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:20:57,973 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:20:57,973 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:57,973 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:20:57,973 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:20:57,973 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration5_Lasso [2023-09-17 11:20:57,973 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:20:57,973 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:20:57,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:57,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,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-09-17 11:20:58,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,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-09-17 11:20:58,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:58,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:20:59,346 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:20:59,346 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:20:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,354 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-09-17 11:20:59,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-09-17 11:20:59,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,383 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-09-17 11:20:59,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-09-17 11:20:59,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,411 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-09-17 11:20:59,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-09-17 11:20:59,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,425 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-09-17 11:20:59,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-09-17 11:20:59,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,441 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-09-17 11:20:59,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-09-17 11:20:59,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,470 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-09-17 11:20:59,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-09-17 11:20:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,517 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-09-17 11:20:59,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:59,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,548 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-09-17 11:20:59,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-09-17 11:20:59,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,577 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-09-17 11:20:59,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-09-17 11:20:59,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,604 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-09-17 11:20:59,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:59,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,618 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-09-17 11:20:59,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-09-17 11:20:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,633 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-09-17 11:20:59,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:59,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,651 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-09-17 11:20:59,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:20:59,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:20:59,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:20:59,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2023-09-17 11:20:59,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,665 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-09-17 11:20:59,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-09-17 11:20:59,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,679 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-09-17 11:20:59,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2023-09-17 11:20:59,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,695 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-09-17 11:20:59,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2023-09-17 11:20:59,708 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Exception during sending of exit command (exit): Broken pipe [2023-09-17 11:20:59,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,709 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-09-17 11:20:59,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,723 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Exception during sending of exit command (exit): Broken pipe [2023-09-17 11:20:59,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:59,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,724 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-09-17 11:20:59,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:59,744 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2023-09-17 11:20:59,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,745 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-09-17 11:20:59,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-09-17 11:20:59,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,762 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-09-17 11:20:59,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2023-09-17 11:20:59,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,789 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-09-17 11:20:59,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-09-17 11:20:59,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,810 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-09-17 11:20:59,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,825 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-09-17 11:20:59,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:59,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,841 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-09-17 11:20:59,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,849 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-09-17 11:20:59,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,852 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2023-09-17 11:20:59,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-09-17 11:20:59,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,863 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-09-17 11:20:59,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:20:59,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2023-09-17 11:20:59,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,880 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-09-17 11:20:59,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:20:59,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:20:59,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:20:59,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:20:59,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:20:59,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:20:59,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:20:59,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:20:59,922 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-09-17 11:20:59,923 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. [2023-09-17 11:20:59,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:20:59,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:20:59,924 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:20:59,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-09-17 11:20:59,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:20:59,933 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-17 11:20:59,933 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:20:59,933 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1#1, ~N~0) = -1*thread2Thread1of1ForFork0_~i~1#1 + 1*~N~0 Supporting invariants [] [2023-09-17 11:20:59,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-09-17 11:21:00,006 INFO L156 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2023-09-17 11:21:00,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:21:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:21:00,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-17 11:21:00,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:21:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:21:00,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-17 11:21:00,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:21:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:21:00,133 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-09-17 11:21:00,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1165 states and 3508 transitions. cyclomatic complexity: 2446 Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:21:00,195 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1165 states and 3508 transitions. cyclomatic complexity: 2446. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 3119 states and 10348 transitions. Complement of second has 8 states. [2023-09-17 11:21:00,196 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-09-17 11:21:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:21:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2023-09-17 11:21:00,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 150 transitions. Stem has 57 letters. Loop has 6 letters. [2023-09-17 11:21:00,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:21:00,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 150 transitions. Stem has 63 letters. Loop has 6 letters. [2023-09-17 11:21:00,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:21:00,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 150 transitions. Stem has 57 letters. Loop has 12 letters. [2023-09-17 11:21:00,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:21:00,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3119 states and 10348 transitions. [2023-09-17 11:21:00,220 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:21:00,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3119 states to 0 states and 0 transitions. [2023-09-17 11:21:00,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 11:21:00,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 11:21:00,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 11:21:00,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:21:00,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:21:00,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:21:00,221 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:21:00,221 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-09-17 11:21:00,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 11:21:00,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:21:00,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 11:21:00,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:21:00 BoogieIcfgContainer [2023-09-17 11:21:00,228 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:21:00,229 INFO L158 Benchmark]: Toolchain (without parser) took 12145.47ms. Allocated memory was 348.1MB in the beginning and 564.1MB in the end (delta: 216.0MB). Free memory was 303.9MB in the beginning and 331.8MB in the end (delta: -27.9MB). Peak memory consumption was 189.2MB. Max. memory is 8.0GB. [2023-09-17 11:21:00,229 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 185.6MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:21:00,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.14ms. Allocated memory is still 348.1MB. Free memory was 303.9MB in the beginning and 292.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 11:21:00,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.01ms. Allocated memory is still 348.1MB. Free memory was 292.3MB in the beginning and 290.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:21:00,229 INFO L158 Benchmark]: Boogie Preprocessor took 16.39ms. Allocated memory is still 348.1MB. Free memory was 290.8MB in the beginning and 289.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 11:21:00,229 INFO L158 Benchmark]: RCFGBuilder took 426.97ms. Allocated memory is still 348.1MB. Free memory was 289.2MB in the beginning and 262.5MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-09-17 11:21:00,229 INFO L158 Benchmark]: BuchiAutomizer took 11471.92ms. Allocated memory was 348.1MB in the beginning and 564.1MB in the end (delta: 216.0MB). Free memory was 262.5MB in the beginning and 331.8MB in the end (delta: -69.3MB). Peak memory consumption was 148.3MB. Max. memory is 8.0GB. [2023-09-17 11:21:00,230 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.08ms. Allocated memory is still 185.6MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.14ms. Allocated memory is still 348.1MB. Free memory was 303.9MB in the beginning and 292.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.01ms. Allocated memory is still 348.1MB. Free memory was 292.3MB in the beginning and 290.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.39ms. Allocated memory is still 348.1MB. Free memory was 290.8MB in the beginning and 289.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 426.97ms. Allocated memory is still 348.1MB. Free memory was 289.2MB in the beginning and 262.5MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 11471.92ms. Allocated memory was 348.1MB in the beginning and 564.1MB in the end (delta: 216.0MB). Free memory was 262.5MB in the beginning and 331.8MB in the end (delta: -69.3MB). Peak memory consumption was 148.3MB. 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[A] + -4 * i and consists of 11 locations. One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 9.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 442 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 934 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 932 mSDsluCounter, 1428 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 944 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 484 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital280 mio100 ax112 hnf100 lsp78 ukn77 mio100 lsp30 div189 bol100 ite100 ukn100 eq151 hnf93 smp66 dnf201 smp69 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 66ms VariablesStem: 4 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-17 11:21:00,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-09-17 11:21:00,448 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...