/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs FAIRNESS_LAZY -i ../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 12:00:05,322 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 12:00:05,385 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 12:00:05,408 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 12:00:05,408 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 12:00:05,409 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 12:00:05,410 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 12:00:05,410 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 12:00:05,410 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 12:00:05,414 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 12:00:05,414 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 12:00:05,414 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 12:00:05,414 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 12:00:05,415 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 12:00:05,416 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 12:00:05,416 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 12:00:05,416 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 12:00:05,416 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 12:00:05,417 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 12:00:05,417 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 12:00:05,417 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 12:00:05,418 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 12:00:05,418 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 12:00:05,418 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 12:00:05,418 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 12:00:05,419 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 12:00:05,419 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 12:00:05,419 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 12:00:05,419 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 12:00:05,420 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 12:00:05,421 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 12:00:05,421 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 12:00:05,421 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 12:00:05,421 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 12:00:05,423 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 12:00:05,423 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> FAIRNESS_LAZY [2023-09-17 12:00:05,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 12:00:05,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 12:00:05,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 12:00:05,654 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 12:00:05,656 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 12:00:05,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-09-17 12:00:06,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 12:00:06,952 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 12:00:06,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-09-17 12:00:06,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e101893a/c4bf3bb5a3ea48728ea956b59e88e90c/FLAG6afba9ecf [2023-09-17 12:00:06,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e101893a/c4bf3bb5a3ea48728ea956b59e88e90c [2023-09-17 12:00:06,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 12:00:06,980 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 12:00:06,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 12:00:06,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 12:00:06,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 12:00:06,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:00:06" (1/1) ... [2023-09-17 12:00:06,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52cf215f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:06, skipping insertion in model container [2023-09-17 12:00:06,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:00:06" (1/1) ... [2023-09-17 12:00:06,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 12:00:07,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 12:00:07,197 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/parallel-min-max-1.wvr.c[2988,3001] [2023-09-17 12:00:07,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:00:07,212 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 12:00:07,232 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/parallel-min-max-1.wvr.c[2988,3001] [2023-09-17 12:00:07,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:00:07,242 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 12:00:07,242 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 12:00:07,247 INFO L208 MainTranslator]: Completed translation [2023-09-17 12:00:07,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07 WrapperNode [2023-09-17 12:00:07,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 12:00:07,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 12:00:07,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 12:00:07,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 12:00:07,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,292 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-09-17 12:00:07,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 12:00:07,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 12:00:07,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 12:00:07,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 12:00:07,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 12:00:07,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 12:00:07,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 12:00:07,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 12:00:07,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (1/1) ... [2023-09-17 12:00:07,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:07,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:07,351 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 12:00:07,368 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 12:00:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 12:00:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 12:00:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 12:00:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-17 12:00:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 12:00:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 12:00:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 12:00:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 12:00:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-17 12:00:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-17 12:00:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 12:00:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 12:00:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 12:00:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-17 12:00:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 12:00:07,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 12:00:07,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 12:00:07,380 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 12:00:07,478 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 12:00:07,479 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 12:00:07,725 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 12:00:07,783 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 12:00:07,783 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-17 12:00:07,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:00:07 BoogieIcfgContainer [2023-09-17 12:00:07,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 12:00:07,786 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 12:00:07,786 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 12:00:07,789 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 12:00:07,789 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:00:07,790 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 12:00:06" (1/3) ... [2023-09-17 12:00:07,790 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fb683d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:00:07, skipping insertion in model container [2023-09-17 12:00:07,790 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:00:07,790 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:07" (2/3) ... [2023-09-17 12:00:07,791 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fb683d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:00:07, skipping insertion in model container [2023-09-17 12:00:07,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:00:07,791 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:00:07" (3/3) ... [2023-09-17 12:00:07,792 INFO L332 chiAutomizerObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2023-09-17 12:00:07,869 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 12:00:07,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 157 transitions, 329 flow [2023-09-17 12:00:07,932 INFO L124 PetriNetUnfolderBase]: 12/151 cut-off events. [2023-09-17 12:00:07,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 12:00:07,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 151 events. 12/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2023-09-17 12:00:07,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 157 transitions, 329 flow [2023-09-17 12:00:07,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 151 transitions, 311 flow [2023-09-17 12:00:07,959 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 12:00:07,959 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 12:00:07,959 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 12:00:07,959 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 12:00:07,959 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 12:00:07,959 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 12:00:07,959 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 12:00:07,960 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 12:00:07,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:00:24,980 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2023-09-17 12:00:24,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:00:24,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:00:24,988 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, 1] [2023-09-17 12:00:24,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:00:24,989 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 12:00:24,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:00:35,200 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2023-09-17 12:00:35,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:00:35,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:00:35,202 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, 1] [2023-09-17 12:00:35,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:00:35,209 INFO L748 eck$LassoCheckResult]: Stem: SleepPredicate [underlying: 155#[$Ultimate##0]don't care, sleep set: []] [286] $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] SleepPredicate [underlying: 158#[L-1]don't care, sleep set: []] [293] L-1-->L-1-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 160#[L-1-1]don't care, sleep set: []] [403] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 162#[L21]don't care, sleep set: []] [365] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 164#[L21-1]don't care, sleep set: []] [384] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 166#[L21-2]don't care, sleep set: []] [302] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 168#[L21-3]don't care, sleep set: []] [352] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= (select |v_#length_8| 2) 25)) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 170#[L21-4]don't care, sleep set: []] [322] L21-4-->L42: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] SleepPredicate [underlying: 172#[L42]don't care, sleep set: []] [311] L42-->L42-1: Formula: (= v_~min~0_7 0) InVars {} OutVars{~min~0=v_~min~0_7} AuxVars[] AssignedVars[~min~0] SleepPredicate [underlying: 174#[L42-1]don't care, sleep set: []] [389] L42-1-->L42-2: Formula: (= v_~max~0_7 0) InVars {} OutVars{~max~0=v_~max~0_7} AuxVars[] AssignedVars[~max~0] SleepPredicate [underlying: 176#[L42-2]don't care, sleep set: []] [320] L42-2-->L43: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] SleepPredicate [underlying: 178#[L43]don't care, sleep set: []] [396] L43-->L43-1: Formula: (= v_~v_assert~0_2 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[~v_assert~0] SleepPredicate [underlying: 180#[L43-1]don't care, sleep set: []] [289] L43-1-->L43-2: Formula: (= v_~b1~0_3 0) InVars {} OutVars{~b1~0=v_~b1~0_3} AuxVars[] AssignedVars[~b1~0] SleepPredicate [underlying: 182#[L43-2]don't care, sleep set: []] [306] L43-2-->L-1-2: Formula: (= v_~b2~0_3 0) InVars {} OutVars{~b2~0=v_~b2~0_3} AuxVars[] AssignedVars[~b2~0] SleepPredicate [underlying: 184#[L-1-2]don't care, sleep set: []] [405] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 186#[L-1-3]don't care, sleep set: []] [407] L-1-3-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_1|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_1|, ULTIMATE.start_main_#t~short19#1=|v_ULTIMATE.start_main_#t~short19#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_1|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_1|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~short19#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre24#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#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_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 188#[L92]don't care, sleep set: []] [379] L92-->L92-1: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_10|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_9|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] SleepPredicate [underlying: 190#[L92-1]don't care, sleep set: []] [370] L92-1-->L92-2: Formula: (and (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_12|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_11|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 192#[L92-2]don't care, sleep set: []] [318] L92-2-->L92-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= |v_#valid_14| (store |v_#valid_15| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (= (select |v_#valid_15| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_13|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] SleepPredicate [underlying: 194#[L92-3]don't care, sleep set: []] [295] L92-3-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] SleepPredicate [underlying: 196#[L95]don't care, sleep set: []] [355] L95-->L95-1: Formula: (= v_~min~0_8 |v_ULTIMATE.start_main_#t~nondet11#1_3|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~min~0=v_~min~0_8} AuxVars[] AssignedVars[~min~0] SleepPredicate [underlying: 198#[L95-1]don't care, sleep set: []] [367] L95-1-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] SleepPredicate [underlying: 200#[L96]don't care, sleep set: []] [380] L96-->L96-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] SleepPredicate [underlying: 202#[L96-1]don't care, sleep set: []] [332] L96-1-->L96-2: Formula: (= v_~max~0_8 |v_ULTIMATE.start_main_#t~nondet12#1_3|) InVars {ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} OutVars{~max~0=v_~max~0_8, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} AuxVars[] AssignedVars[~max~0] SleepPredicate [underlying: 204#[L96-2]don't care, sleep set: []] [276] L96-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] SleepPredicate [underlying: 206#[L97]don't care, sleep set: []] [342] L97-->L97-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] SleepPredicate [underlying: 208#[L97-1]don't care, sleep set: []] [350] L97-1-->L97-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet13#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] SleepPredicate [underlying: 210#[L97-2]don't care, sleep set: []] [400] L97-2-->L98: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] SleepPredicate [underlying: 212#[L98]don't care, sleep set: []] [369] L98-->L98-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~N~0_7) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 214#[L98-1]don't care, sleep set: []] [266] L98-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 216#[L37]don't care, sleep set: []] [312] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 218#[L38]don't care, sleep set: []] [324] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 222#[L37-1]don't care, sleep set: []] [313] L37-1-->L99: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] SleepPredicate [underlying: 224#[L99]don't care, sleep set: []] [375] L99-->L99-1: Formula: (= v_~b1~0_4 |v_ULTIMATE.start_main_#t~nondet14#1_3|) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} OutVars{~b1~0=v_~b1~0_4, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[~b1~0] SleepPredicate [underlying: 226#[L99-1]don't care, sleep set: []] [299] L99-1-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] SleepPredicate [underlying: 228#[L100]don't care, sleep set: []] [310] L100-->L100-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1] SleepPredicate [underlying: 230#[L100-1]don't care, sleep set: []] [341] L100-1-->L100-2: Formula: (= v_~b2~0_4 |v_ULTIMATE.start_main_#t~nondet15#1_3|) InVars {ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|} OutVars{~b2~0=v_~b2~0_4, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|} AuxVars[] AssignedVars[~b2~0] SleepPredicate [underlying: 232#[L100-2]don't care, sleep set: []] [368] L100-2-->L101: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1] SleepPredicate [underlying: 234#[L101]don't care, sleep set: []] [392] L101-->L101-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1] SleepPredicate [underlying: 236#[L101-1]don't care, sleep set: []] [271] L101-1-->L101-2: Formula: (= v_~v_assert~0_3 |v_ULTIMATE.start_main_#t~nondet16#1_3|) InVars {ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_3|} OutVars{~v_assert~0=v_~v_assert~0_3, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_3|} AuxVars[] AssignedVars[~v_assert~0] SleepPredicate [underlying: 238#[L101-2]don't care, sleep set: []] [351] L101-2-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1] SleepPredicate [underlying: 240#[L102]don't care, sleep set: []] [298] L102-->L102-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_8) InVars {~N~0=v_~N~0_8} 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_8} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] SleepPredicate [underlying: 242#[L102-1]don't care, sleep set: []] [273] L102-1-->L102-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] SleepPredicate [underlying: 244#[L102-2]don't care, sleep set: []] [297] L102-2-->L117: 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_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_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~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base, ULTIMATE.start_create_fresh_int_array_~size#1] SleepPredicate [underlying: 246#[L117]don't care, sleep set: []] [260] L117-->L118: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |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_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] SleepPredicate [underlying: 248#[L118]don't care, sleep set: []] [360] L118-->L118-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 250#[L118-1]don't care, sleep set: []] [307] L118-1-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 252#[L37-2]don't care, sleep set: []] [269] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 254#[L38-3]don't care, sleep set: []] [291] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 258#[L37-3]don't care, sleep set: []] [287] L37-3-->L119: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 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_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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] SleepPredicate [underlying: 260#[L119]don't care, sleep set: []] [391] L119-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 262#[L37-4]don't care, sleep set: []] [377] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) 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_10|, 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] SleepPredicate [underlying: 264#[L38-6]don't care, sleep set: []] [363] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 268#[L37-5]don't care, sleep set: []] [345] L37-5-->L121: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 270#[L121]don't care, sleep set: []] [283] L121-->L121-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2| |v_#StackHeapBarrier_5|) (= |v_#valid_16| (store |v_#valid_17| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2| 1)) (= (select |v_#valid_17| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2| 0) (= (store |v_#length_16| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #valid=|v_#valid_16|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_2|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base] SleepPredicate [underlying: 272#[L121-1]don't care, sleep set: []] [372] L121-1-->L121-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_3|, 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|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] SleepPredicate [underlying: 274#[L121-2]don't care, sleep set: []] [263] L121-2-->L122: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.base] SleepPredicate [underlying: 276#[L122]don't care, sleep set: []] [303] L122-->L122-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] SleepPredicate [underlying: 278#[L122-6]don't care, sleep set: []] [2023-09-17 12:00:35,210 INFO L750 eck$LassoCheckResult]: Loop: SleepPredicate [underlying: 278#[L122-6]don't care, sleep set: []] [385] L122-6-->L123: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, 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_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 280#[L123]don't care, sleep set: []] [277] L123-->L123-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet28#1] SleepPredicate [underlying: 284#[L123-1]don't care, sleep set: []] [288] L123-1-->L123-2: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_17| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (<= 0 .cse1) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_3|)) |v_#memory_int_9|) (= (select |v_#valid_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {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_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, 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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, #length=|v_#length_17|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] SleepPredicate [underlying: 288#[L123-2]don't care, sleep set: []] [296] L123-2-->L122-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet28#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet28#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet28#1] SleepPredicate [underlying: 292#[L122-3]don't care, sleep set: []] [373] L122-3-->L122-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#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_#t~post27#1] SleepPredicate [underlying: 296#[L122-4]don't care, sleep set: []] [399] L122-4-->L122-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_3| 1)) InVars {ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] SleepPredicate [underlying: 300#[L122-5]don't care, sleep set: []] [330] L122-5-->L122-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post27#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post27#1] SleepPredicate [underlying: 278#[L122-6]don't care, sleep set: []] [2023-09-17 12:00:35,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:00:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1613257629, now seen corresponding path program 1 times [2023-09-17 12:00:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:00:35,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142916087] [2023-09-17 12:00:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:00:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:00:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:00:35,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:00:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:00:35,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:00:35,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:00:35,594 INFO L85 PathProgramCache]: Analyzing trace with hash -550152589, now seen corresponding path program 1 times [2023-09-17 12:00:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:00:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179080313] [2023-09-17 12:00:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:00:35,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:00:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:00:35,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:00:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:00:35,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:00:35,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:00:35,625 INFO L85 PathProgramCache]: Analyzing trace with hash -633867433, now seen corresponding path program 1 times [2023-09-17 12:00:35,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:00:35,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015483960] [2023-09-17 12:00:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:00:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:00:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:00:35,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:00:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:00:35,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:00:36,749 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 12:00:36,750 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 12:00:36,750 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 12:00:36,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 12:00:36,750 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 12:00:36,751 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:36,751 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 12:00:36,751 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 12:00:36,751 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-min-max-1.wvr.c_BEv2_Iteration1_Lasso [2023-09-17 12:00:36,751 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 12:00:36,751 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 12:00:36,768 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 12:00:36,774 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 12:00:36,776 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 12:00:36,778 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 12:00:36,780 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 12:00:36,782 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 12:00:36,784 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 12:00:37,118 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 12:00:37,120 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 12:00:37,122 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 12:00:37,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 12:00:37,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 12:00:37,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 12:00:37,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 12:00:37,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 12:00:37,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 12:00:37,135 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 12:00:37,137 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 12:00:37,139 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 12:00:37,140 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 12:00:37,142 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 12:00:37,144 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 12:00:37,146 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 12:00:37,147 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 12:00:37,149 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 12:00:37,151 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 12:00:37,153 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 12:00:37,155 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 12:00:37,157 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 12:00:37,158 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 12:00:37,160 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 12:00:37,161 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 12:00:37,163 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 12:00:37,164 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 12:00:37,166 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 12:00:37,167 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 12:00:37,169 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 12:00:37,170 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 12:00:37,172 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 12:00:37,174 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 12:00:37,176 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 12:00:37,177 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 12:00:37,178 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 12:00:37,180 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 12:00:37,632 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 12:00:37,636 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 12:00:37,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,649 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 12:00:37,650 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 12:00:37,657 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 12:00:37,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:37,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,700 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 12:00:37,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,702 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 12:00:37,704 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 12:00:37,706 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 12:00:37,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 12:00:37,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 12:00:37,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 12:00:37,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,733 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 12:00:37,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,735 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 12:00:37,737 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 12:00:37,739 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 12:00:37,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:37,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,770 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 12:00:37,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,772 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 12:00:37,773 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 12:00:37,775 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 12:00:37,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:37,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,803 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 12:00:37,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,804 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 12:00:37,806 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 12:00:37,808 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 12:00:37,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:37,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,835 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 12:00:37,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,836 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 12:00:37,838 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 12:00:37,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 12:00:37,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:37,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-09-17 12:00:37,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,870 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 12:00:37,871 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 12:00:37,872 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 12:00:37,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:37,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,900 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 12:00:37,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,901 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 12:00:37,904 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 12:00:37,905 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 12:00:37,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:37,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,933 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 12:00:37,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,935 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 12:00:37,937 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 12:00:37,939 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 12:00:37,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:37,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:00:37,978 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 12:00:37,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:37,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:37,979 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 12:00:37,984 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 12:00:37,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:00:37,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:00:37,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:00:37,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:00:37,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:00:37,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:00:38,006 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 12:00:38,009 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 12:00:38,036 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-09-17 12:00:38,036 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-09-17 12:00:38,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:00:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:00:38,093 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 12:00:38,123 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 12:00:38,131 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 12:00:38,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-17 12:00:38,150 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 12:00:38,151 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [] [2023-09-17 12:00:38,158 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 12:00:38,227 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2023-09-17 12:00:38,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:00:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:00:38,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-17 12:00:38,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:00:38,448 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 12:00:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:00:38,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-17 12:00:38,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:00:38,648 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 12:00:38,687 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 12:00:38,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 12:00:58,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 162382 states and 653860 transitions. Complement of second has 9 states. [2023-09-17 12:00:58,233 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 12:00:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 12:00:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2023-09-17 12:00:58,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 262 transitions. Stem has 58 letters. Loop has 7 letters. [2023-09-17 12:00:58,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:00:58,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 262 transitions. Stem has 65 letters. Loop has 7 letters. [2023-09-17 12:00:58,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:00:58,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 262 transitions. Stem has 58 letters. Loop has 14 letters. [2023-09-17 12:00:58,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:00:58,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162382 states and 653860 transitions. [2023-09-17 12:01:01,191 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:01:01,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162382 states to 0 states and 0 transitions. [2023-09-17 12:01:01,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 12:01:01,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 12:01:01,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 12:01:01,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 12:01:01,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:01:01,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:01:01,195 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:01:01,195 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 12:01:01,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 12:01:01,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:01:01,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 12:01:01,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 12:01:01 BoogieIcfgContainer [2023-09-17 12:01:01,200 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 12:01:01,201 INFO L158 Benchmark]: Toolchain (without parser) took 54220.45ms. Allocated memory was 237.0MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 185.2MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-09-17 12:01:01,201 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 237.0MB. Free memory is still 193.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 12:01:01,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.69ms. Allocated memory is still 237.0MB. Free memory was 185.0MB in the beginning and 173.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 12:01:01,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.95ms. Allocated memory is still 237.0MB. Free memory was 173.4MB in the beginning and 171.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 12:01:01,202 INFO L158 Benchmark]: Boogie Preprocessor took 28.98ms. Allocated memory is still 237.0MB. Free memory was 171.3MB in the beginning and 169.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 12:01:01,202 INFO L158 Benchmark]: RCFGBuilder took 462.13ms. Allocated memory was 237.0MB in the beginning and 466.6MB in the end (delta: 229.6MB). Free memory was 169.8MB in the beginning and 427.8MB in the end (delta: -258.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-09-17 12:01:01,203 INFO L158 Benchmark]: BuchiAutomizer took 53414.18ms. Allocated memory was 466.6MB in the beginning and 7.1GB in the end (delta: 6.7GB). Free memory was 427.8MB in the beginning and 5.7GB in the end (delta: -5.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-09-17 12:01:01,206 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 237.0MB. Free memory is still 193.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.69ms. Allocated memory is still 237.0MB. Free memory was 185.0MB in the beginning and 173.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.95ms. Allocated memory is still 237.0MB. Free memory was 173.4MB in the beginning and 171.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.98ms. Allocated memory is still 237.0MB. Free memory was 171.3MB in the beginning and 169.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 462.13ms. Allocated memory was 237.0MB in the beginning and 466.6MB in the end (delta: 229.6MB). Free memory was 169.8MB in the beginning and 427.8MB in the end (delta: -258.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 53414.18ms. Allocated memory was 466.6MB in the beginning and 7.1GB in the end (delta: 6.7GB). Free memory was 427.8MB in the beginning and 5.7GB in the end (delta: -5.3GB). Peak memory consumption was 1.4GB. 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 53.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 19.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 2.9s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 116 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax121 hnf100 lsp72 ukn69 mio100 lsp37 div242 bol100 ite100 ukn100 eq147 hnf94 smp60 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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 12:01:01,222 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...