/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs NONE -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:25:47,596 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:25:47,670 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 11:25:47,701 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:25:47,702 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:25:47,703 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:25:47,704 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:25:47,704 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:25:47,705 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:25:47,708 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:25:47,708 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:25:47,709 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:25:47,709 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:25:47,710 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:25:47,711 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:25:47,711 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:25:47,711 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:25:47,711 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:25:47,712 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:25:47,712 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:25:47,712 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:25:47,713 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:25:47,713 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:25:47,713 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:25:47,713 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:25:47,713 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:25:47,713 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:25:47,714 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:25:47,714 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:25:47,714 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:25:47,715 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:25:47,715 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:25:47,715 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:25:47,716 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:25:47,717 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:25:47,717 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> NONE [2023-09-17 11:25:47,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:25:48,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:25:48,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:25:48,011 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:25:48,011 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:25:48,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2023-09-17 11:25:49,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:25:49,466 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:25:49,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2023-09-17 11:25:49,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205bec976/d58560032f7245dd88707f8d5f1a136f/FLAGaf9c1a077 [2023-09-17 11:25:49,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205bec976/d58560032f7245dd88707f8d5f1a136f [2023-09-17 11:25:49,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:25:49,496 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:25:49,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:25:49,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:25:49,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:25:49,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5976a7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49, skipping insertion in model container [2023-09-17 11:25:49,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:25:49,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:25:49,668 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2604,2617] [2023-09-17 11:25:49,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:25:49,682 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:25:49,699 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2604,2617] [2023-09-17 11:25:49,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:25:49,708 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:25:49,709 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:25:49,714 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:25:49,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49 WrapperNode [2023-09-17 11:25:49,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:25:49,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:25:49,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:25:49,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:25:49,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,749 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 138 [2023-09-17 11:25:49,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:25:49,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:25:49,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:25:49,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:25:49,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:25:49,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:25:49,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:25:49,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:25:49,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (1/1) ... [2023-09-17 11:25:49,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:49,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:49,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:49,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-09-17 11:25:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:25:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 11:25:49,858 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 11:25:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 11:25:49,858 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 11:25:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:25:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:25:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:25:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:25:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:25:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-17 11:25:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:25:49,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:25:49,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-17 11:25:49,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:25:49,861 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 11:25:49,953 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:25:49,955 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:25:50,203 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:25:50,291 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:25:50,292 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-17 11:25:50,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:25:50 BoogieIcfgContainer [2023-09-17 11:25:50,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:25:50,295 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:25:50,295 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:25:50,302 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:25:50,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:25:50,303 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:25:49" (1/3) ... [2023-09-17 11:25:50,304 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e21aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:25:50, skipping insertion in model container [2023-09-17 11:25:50,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:25:50,304 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:25:49" (2/3) ... [2023-09-17 11:25:50,304 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e21aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:25:50, skipping insertion in model container [2023-09-17 11:25:50,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:25:50,305 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:25:50" (3/3) ... [2023-09-17 11:25:50,307 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2023-09-17 11:25:50,392 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:25:50,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 118 transitions, 246 flow [2023-09-17 11:25:50,484 INFO L124 PetriNetUnfolderBase]: 11/114 cut-off events. [2023-09-17 11:25:50,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:25:50,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 114 events. 11/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-09-17 11:25:50,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 118 transitions, 246 flow [2023-09-17 11:25:50,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 114 transitions, 234 flow [2023-09-17 11:25:50,514 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:25:50,514 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:25:50,514 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:25:50,515 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:25:50,515 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:25:50,515 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:25:50,515 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:25:50,515 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:25:50,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-17 11:25:50,829 INFO L131 ngComponentsAnalysis]: Automaton has 167 accepting balls. 2015 [2023-09-17 11:25:50,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:25:50,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:25:50,838 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] [2023-09-17 11:25:50,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:25:50,838 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:25:50,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2409 states, but on-demand construction may add more states [2023-09-17 11:25:50,883 INFO L131 ngComponentsAnalysis]: Automaton has 167 accepting balls. 2015 [2023-09-17 11:25:50,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:25:50,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:25:50,885 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] [2023-09-17 11:25:50,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:25:50,895 INFO L748 eck$LassoCheckResult]: Stem: 115#[$Ultimate##0]don't care [261] $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] 118#[L-1]don't care [270] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 120#[L-1-1]don't care [345] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 122#[L21]don't care [318] L21-->L21-1: Formula: (and (= (select |v_#length_9| 1) 2) (= (select |v_#valid_14| 1) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 124#[L21-1]don't care [335] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_10| 1) 0)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 126#[L21-2]don't care [276] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_11| 1) 1) 0) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 128#[L21-3]don't care [309] L21-3-->L21-4: Formula: (and (= 30 (select |v_#length_10| 2)) (= (select |v_#valid_15| 2) 1)) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 130#[L21-4]don't care [294] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 132#[L42]don't care [283] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 134#[L42-1]don't care [336] L42-1-->L42-2: Formula: (= v_~back~0_9 0) InVars {} OutVars{~back~0=v_~back~0_9} AuxVars[] AssignedVars[~back~0] 136#[L42-2]don't care [292] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0] 138#[L42-3]don't care [253] L42-3-->L-1-2: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 140#[L-1-2]don't care [346] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 142#[L-1-3]don't care [351] L-1-3-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_4|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 144#[L80]don't care [243] L80-->L80-1: Formula: (and (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= (store |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_16|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 146#[L80-1]don't care [333] L80-1-->L80-2: Formula: (and (= |v_#valid_18| (store |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_13|) (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 148#[L80-2]don't care [250] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1] 150#[L82]don't care [312] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 152#[L82-1]don't care [244] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[~n~0] 154#[L82-2]don't care [348] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 156#[L83]don't care [254] L83-->L83-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 158#[L83-1]don't care [298] L83-1-->L83-2: Formula: (= v_~front~0_6 |v_ULTIMATE.start_main_#t~nondet10#1_3|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 160#[L83-2]don't care [328] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 162#[L84]don't care [337] L84-->L85: Formula: (= v_~front~0_7 v_~back~0_10) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_10, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 164#[L85]don't care [268] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 166#[L85-1]don't care [280] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 168#[L85-2]don't care [241] L85-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 170#[L97]don't care [303] L97-->L98: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |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_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 172#[L98]don't care [320] L98-->L98-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_1|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 174#[L98-1]don't care [248] 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] 176#[L37]don't care [284] 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] 178#[L38]don't care [296] 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[] 182#[L37-1]don't care [285] L37-1-->L99: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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] 184#[L99]don't care [322] L99-->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] 186#[L37-2]don't care [249] 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] 188#[L38-3]don't care [266] 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[] 192#[L37-3]don't care [262] L37-3-->L101: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 194#[L101]don't care [341] L101-->L101-1: Formula: (and (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 1073741824)))) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 196#[L101-1]don't care [251] L101-1-->L101-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 198#[L101-2]don't care [308] L101-2-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 200#[L102]don't care [274] L102-->L102-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 202#[L102-6]don't care [2023-09-17 11:25:50,899 INFO L750 eck$LassoCheckResult]: Loop: 202#[L102-6]don't care [256] L102-6-->L103: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[] 204#[L103]don't care [338] L103-->L103-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 208#[L103-1]don't care [271] L103-1-->L103-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 212#[L103-2]don't care [317] L103-2-->L102-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 216#[L102-3]don't care [286] L102-3-->L102-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 220#[L102-4]don't care [269] L102-4-->L102-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 224#[L102-5]don't care [342] L102-5-->L102-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 202#[L102-6]don't care [2023-09-17 11:25:50,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash 824422329, now seen corresponding path program 1 times [2023-09-17 11:25:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:50,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819731788] [2023-09-17 11:25:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:51,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:51,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:51,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1637761402, now seen corresponding path program 1 times [2023-09-17 11:25:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033041911] [2023-09-17 11:25:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:51,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:51,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:51,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 123957198, now seen corresponding path program 1 times [2023-09-17 11:25:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:51,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815736076] [2023-09-17 11:25:51,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:51,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:51,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:52,369 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:25:52,370 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:25:52,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:25:52,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:25:52,370 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:25:52,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:52,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:25:52,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:25:52,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive-alt.wvr.c_BEv2_Iteration1_Lasso [2023-09-17 11:25:52,371 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:25:52,371 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:25:52,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,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 11:25:52,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 11:25:52,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:52,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:53,275 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:25:53,278 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:25:53,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:53,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:53,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:53,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:53,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:53,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:25:53,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:53,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:53,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:53,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:25:53,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:25:53,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-09-17 11:25:53,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:53,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:53,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:53,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:53,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:53,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:53,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:53,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:53,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:53,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:53,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-09-17 11:25:53,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:53,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:53,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:53,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:53,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:53,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-09-17 11:25:53,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:53,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:53,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:53,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:53,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:53,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:53,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:53,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:53,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:53,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:53,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:53,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:53,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-09-17 11:25:53,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:53,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:53,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:53,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:53,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:53,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:53,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:53,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:53,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:53,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:53,462 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:53,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:53,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:53,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:53,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:53,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:53,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:53,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:53,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-09-17 11:25:53,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:53,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:53,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:53,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:53,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:53,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:53,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:53,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:53,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:53,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:53,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:53,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:53,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-09-17 11:25:53,561 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:25:53,600 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2023-09-17 11:25:53,601 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-09-17 11:25:53,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:53,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:53,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-09-17 11:25:53,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:25:53,664 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-09-17 11:25:53,664 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:25:53,665 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset >= 0] [2023-09-17 11:25:53,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:53,713 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2023-09-17 11:25:53,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:25:53,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-17 11:25:53,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:25:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:25:53,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-17 11:25:53,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:25:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:25:54,054 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2023-09-17 11:25:54,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2409 states, but on-demand construction may add more states Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:25:54,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:54,332 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2409 states, but on-demand construction may add more states. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 4853 states and 15309 transitions. Complement of second has 12 states. [2023-09-17 11:25:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-17 11:25:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:25:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2023-09-17 11:25:54,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 190 transitions. Stem has 41 letters. Loop has 7 letters. [2023-09-17 11:25:54,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:25:54,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 190 transitions. Stem has 48 letters. Loop has 7 letters. [2023-09-17 11:25:54,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:25:54,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 190 transitions. Stem has 41 letters. Loop has 14 letters. [2023-09-17 11:25:54,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:25:54,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4853 states and 15309 transitions. [2023-09-17 11:25:54,410 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 984 [2023-09-17 11:25:54,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4853 states to 1099 states and 3073 transitions. [2023-09-17 11:25:54,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1090 [2023-09-17 11:25:54,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1092 [2023-09-17 11:25:54,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1099 states and 3073 transitions. [2023-09-17 11:25:54,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:25:54,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1099 states and 3073 transitions. [2023-09-17 11:25:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states and 3073 transitions. [2023-09-17 11:25:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1098. [2023-09-17 11:25:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1098 states have (on average 2.797814207650273) internal successors, (3072), 1097 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:25:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 3072 transitions. [2023-09-17 11:25:54,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1098 states and 3072 transitions. [2023-09-17 11:25:54,525 INFO L428 stractBuchiCegarLoop]: Abstraction has 1098 states and 3072 transitions. [2023-09-17 11:25:54,525 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:25:54,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1098 states and 3072 transitions. [2023-09-17 11:25:54,533 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 984 [2023-09-17 11:25:54,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:25:54,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:25:54,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:25:54,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-09-17 11:25:54,536 INFO L748 eck$LassoCheckResult]: Stem: 11041#[$Ultimate##0]don't care [261] $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] 11043#[L-1]don't care [270] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 12015#[L-1-1]don't care [345] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 12017#[L21]don't care [318] L21-->L21-1: Formula: (and (= (select |v_#length_9| 1) 2) (= (select |v_#valid_14| 1) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 12207#[L21-1]don't care [335] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_10| 1) 0)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 11157#[L21-2]don't care [276] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_11| 1) 1) 0) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 11159#[L21-3]don't care [309] L21-3-->L21-4: Formula: (and (= 30 (select |v_#length_10| 2)) (= (select |v_#valid_15| 2) 1)) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 12127#[L21-4]don't care [294] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 11647#[L42]don't care [283] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 11649#[L42-1]don't care [336] L42-1-->L42-2: Formula: (= v_~back~0_9 0) InVars {} OutVars{~back~0=v_~back~0_9} AuxVars[] AssignedVars[~back~0] 11249#[L42-2]don't care [292] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0] 11251#[L42-3]don't care [253] L42-3-->L-1-2: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 11887#[L-1-2]don't care [346] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 12211#[L-1-3]don't care [351] L-1-3-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_4|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 10929#[L80]don't care [243] L80-->L80-1: Formula: (and (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= (store |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_16|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 10931#[L80-1]don't care [333] L80-1-->L80-2: Formula: (and (= |v_#valid_18| (store |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_13|) (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 11453#[L80-2]don't care [250] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1] 11559#[L82]don't care [312] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 11971#[L82-1]don't care [244] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[~n~0] 12041#[L82-2]don't care [348] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 12065#[L83]don't care [254] L83-->L83-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 12067#[L83-1]don't care [298] L83-1-->L83-2: Formula: (= v_~front~0_6 |v_ULTIMATE.start_main_#t~nondet10#1_3|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 10701#[L83-2]don't care [328] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 10703#[L84]don't care [337] L84-->L85: Formula: (= v_~front~0_7 v_~back~0_10) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_10, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 12099#[L85]don't care [268] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 12101#[L85-1]don't care [280] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 10893#[L85-2]don't care [241] L85-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 10895#[L97]don't care [303] L97-->L98: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |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_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 11983#[L98]don't care [320] L98-->L98-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_1|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 11853#[L98-1]don't care [248] 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] 10419#[L37]don't care [284] 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] 10421#[L38]don't care [296] 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[] 11931#[L37-1]don't care [285] L37-1-->L99: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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] 11933#[L99]don't care [322] L99-->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] 11861#[L37-2]don't care [249] 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] 10279#[L38-3]don't care [266] 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[] 10281#[L37-3]don't care [262] L37-3-->L101: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11585#[L101]don't care [341] L101-->L101-1: Formula: (and (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 1073741824)))) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 12193#[L101-1]don't care [251] L101-1-->L101-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 12195#[L101-2]don't care [308] L101-2-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 11609#[L102]don't care [274] L102-->L102-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 11611#[L102-6]don't care [257] L102-6-->L102-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[] 12069#[L102-7]don't care [282] L102-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 12227#[create_fresh_int_array_returnLabel#1]don't care [332] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base] 12229#[L85-3]don't care [325] L85-3-->L85-4: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 12225#[L85-4]don't care [277] L85-4-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base] 10629#[L88]don't care [314] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 10631#[L88-1]don't care [334] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 10727#[L88-2]don't care [246] L88-2-->L88-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre12#1_2|)) |v_#memory_int_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_7|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_6|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 11553#[L88-3]don't care [385] L88-3-->L52: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 11499#[L88-4, L52]don't care [2023-09-17 11:25:54,536 INFO L750 eck$LassoCheckResult]: Loop: 11499#[L88-4, L52]don't care [353] L52-->L47: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 11221#[L88-4, L47]don't care [356] L47-->L47-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 11223#[L47-3, L88-4]don't care [359] L47-3-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 11497#[L48, L88-4]don't care [361] L48-->L52: Formula: (let ((.cse0 (* v_~front~0_33 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_22))) (and (<= (+ .cse0 4 v_~queue~0.offset_22) (select |v_#length_31| v_~queue~0.base_22)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~front~0_33 v_~n~0_12) (<= 0 v_~front~0_33) (< v_~front~0_33 v_~back~0_43)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~front~0_32 (+ v_~front~0_33 1)) (<= 0 .cse1) (= v_~sum~0_21 (+ v_~sum~0_22 (select (select |v_#memory_int_28| v_~queue~0.base_22) .cse1))) (= (select |v_#valid_36| v_~queue~0.base_22) 1)))) InVars {~sum~0=v_~sum~0_22, ~queue~0.offset=v_~queue~0.offset_22, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_28|, ~back~0=v_~back~0_43, #length=|v_#length_31|, ~queue~0.base=v_~queue~0.base_22, ~n~0=v_~n~0_12, ~front~0=v_~front~0_33} OutVars{~queue~0.offset=v_~queue~0.offset_22, ~back~0=v_~back~0_43, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_22, ~sum~0=v_~sum~0_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_28|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #length=|v_#length_31|, ~n~0=v_~n~0_12, ~front~0=v_~front~0_32} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~front~0] 11499#[L88-4, L52]don't care [2023-09-17 11:25:54,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1063377001, now seen corresponding path program 1 times [2023-09-17 11:25:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572144135] [2023-09-17 11:25:54,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:54,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:54,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:54,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash 11793350, now seen corresponding path program 1 times [2023-09-17 11:25:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980750192] [2023-09-17 11:25:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:54,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:54,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:54,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1859954642, now seen corresponding path program 1 times [2023-09-17 11:25:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:54,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095371065] [2023-09-17 11:25:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:54,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:25:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:25:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:25:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095371065] [2023-09-17 11:25:55,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095371065] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:25:55,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:25:55,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-17 11:25:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309058573] [2023-09-17 11:25:55,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:25:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:25:55,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-17 11:25:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-09-17 11:25:55,313 INFO L87 Difference]: Start difference. First operand 1098 states and 3072 transitions. cyclomatic complexity: 2069 Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:25:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:25:55,592 INFO L93 Difference]: Finished difference Result 2087 states and 5643 transitions. [2023-09-17 11:25:55,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2087 states and 5643 transitions. [2023-09-17 11:25:55,614 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 984 [2023-09-17 11:25:55,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2087 states to 1103 states and 3076 transitions. [2023-09-17 11:25:55,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1091 [2023-09-17 11:25:55,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1091 [2023-09-17 11:25:55,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1103 states and 3076 transitions. [2023-09-17 11:25:55,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:25:55,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1103 states and 3076 transitions. [2023-09-17 11:25:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states and 3076 transitions. [2023-09-17 11:25:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1098. [2023-09-17 11:25:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1098 states have (on average 2.796903460837887) internal successors, (3071), 1097 states have internal predecessors, (3071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:25:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 3071 transitions. [2023-09-17 11:25:55,662 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1098 states and 3071 transitions. [2023-09-17 11:25:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-17 11:25:55,663 INFO L428 stractBuchiCegarLoop]: Abstraction has 1098 states and 3071 transitions. [2023-09-17 11:25:55,664 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-09-17 11:25:55,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1098 states and 3071 transitions. [2023-09-17 11:25:55,671 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 984 [2023-09-17 11:25:55,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:25:55,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:25:55,673 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:25:55,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-09-17 11:25:55,704 INFO L748 eck$LassoCheckResult]: Stem: 15355#[$Ultimate##0]don't care [261] $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] 15357#[L-1]don't care [270] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 16329#[L-1-1]don't care [345] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 16331#[L21]don't care [318] L21-->L21-1: Formula: (and (= (select |v_#length_9| 1) 2) (= (select |v_#valid_14| 1) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 16519#[L21-1]don't care [335] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_10| 1) 0)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 15469#[L21-2]don't care [276] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_11| 1) 1) 0) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 15471#[L21-3]don't care [309] L21-3-->L21-4: Formula: (and (= 30 (select |v_#length_10| 2)) (= (select |v_#valid_15| 2) 1)) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 16439#[L21-4]don't care [294] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 15961#[L42]don't care [283] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 15963#[L42-1]don't care [336] L42-1-->L42-2: Formula: (= v_~back~0_9 0) InVars {} OutVars{~back~0=v_~back~0_9} AuxVars[] AssignedVars[~back~0] 15563#[L42-2]don't care [292] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0] 15565#[L42-3]don't care [253] L42-3-->L-1-2: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 16201#[L-1-2]don't care [346] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 16523#[L-1-3]don't care [351] L-1-3-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_4|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 15239#[L80]don't care [243] L80-->L80-1: Formula: (and (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= (store |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_16|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 15241#[L80-1]don't care [333] L80-1-->L80-2: Formula: (and (= |v_#valid_18| (store |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_13|) (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 15771#[L80-2]don't care [250] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1] 15873#[L82]don't care [312] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 16285#[L82-1]don't care [244] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[~n~0] 16355#[L82-2]don't care [348] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 16379#[L83]don't care [254] L83-->L83-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 16381#[L83-1]don't care [298] L83-1-->L83-2: Formula: (= v_~front~0_6 |v_ULTIMATE.start_main_#t~nondet10#1_3|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 15015#[L83-2]don't care [328] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 15017#[L84]don't care [337] L84-->L85: Formula: (= v_~front~0_7 v_~back~0_10) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_10, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 16411#[L85]don't care [268] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 16413#[L85-1]don't care [280] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 15207#[L85-2]don't care [241] L85-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 15209#[L97]don't care [303] L97-->L98: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |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_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 16297#[L98]don't care [320] L98-->L98-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_1|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 16167#[L98-1]don't care [248] 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] 14739#[L37]don't care [284] 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] 14741#[L38]don't care [296] 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[] 16245#[L37-1]don't care [285] L37-1-->L99: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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] 16247#[L99]don't care [322] L99-->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] 16175#[L37-2]don't care [249] 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] 14593#[L38-3]don't care [266] 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[] 14595#[L37-3]don't care [262] L37-3-->L101: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 15899#[L101]don't care [341] L101-->L101-1: Formula: (and (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 1073741824)))) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 16505#[L101-1]don't care [251] L101-1-->L101-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 16507#[L101-2]don't care [308] L101-2-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 15923#[L102]don't care [274] L102-->L102-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 15925#[L102-6]don't care [256] L102-6-->L103: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[] 16383#[L103]don't care [338] L103-->L103-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 15915#[L103-1]don't care [271] L103-1-->L103-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 15917#[L103-2]don't care [317] L103-2-->L102-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 16435#[L102-3]don't care [286] L102-3-->L102-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 16415#[L102-4]don't care [269] L102-4-->L102-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 16107#[L102-5]don't care [342] L102-5-->L102-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 16111#[L102-6]don't care [257] L102-6-->L102-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[] 16539#[L102-7]don't care [282] L102-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 16541#[create_fresh_int_array_returnLabel#1]don't care [332] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base] 16543#[L85-3]don't care [325] L85-3-->L85-4: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 16537#[L85-4]don't care [277] L85-4-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base] 14943#[L88]don't care [314] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 14945#[L88-1]don't care [334] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 15041#[L88-2]don't care [246] L88-2-->L88-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre12#1_2|)) |v_#memory_int_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_7|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_6|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 15867#[L88-3]don't care [385] L88-3-->L52: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 15813#[L88-4, L52]don't care [2023-09-17 11:25:55,705 INFO L750 eck$LassoCheckResult]: Loop: 15813#[L88-4, L52]don't care [353] L52-->L47: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 15533#[L88-4, L47]don't care [356] L47-->L47-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 15535#[L47-3, L88-4]don't care [359] L47-3-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 15811#[L48, L88-4]don't care [361] L48-->L52: Formula: (let ((.cse0 (* v_~front~0_33 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_22))) (and (<= (+ .cse0 4 v_~queue~0.offset_22) (select |v_#length_31| v_~queue~0.base_22)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~front~0_33 v_~n~0_12) (<= 0 v_~front~0_33) (< v_~front~0_33 v_~back~0_43)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~front~0_32 (+ v_~front~0_33 1)) (<= 0 .cse1) (= v_~sum~0_21 (+ v_~sum~0_22 (select (select |v_#memory_int_28| v_~queue~0.base_22) .cse1))) (= (select |v_#valid_36| v_~queue~0.base_22) 1)))) InVars {~sum~0=v_~sum~0_22, ~queue~0.offset=v_~queue~0.offset_22, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_28|, ~back~0=v_~back~0_43, #length=|v_#length_31|, ~queue~0.base=v_~queue~0.base_22, ~n~0=v_~n~0_12, ~front~0=v_~front~0_33} OutVars{~queue~0.offset=v_~queue~0.offset_22, ~back~0=v_~back~0_43, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_22, ~sum~0=v_~sum~0_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_28|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #length=|v_#length_31|, ~n~0=v_~n~0_12, ~front~0=v_~front~0_32} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~front~0] 15813#[L88-4, L52]don't care [2023-09-17 11:25:55,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash 518021108, now seen corresponding path program 1 times [2023-09-17 11:25:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310478039] [2023-09-17 11:25:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:55,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:55,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:55,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 11793350, now seen corresponding path program 2 times [2023-09-17 11:25:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:55,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455781449] [2023-09-17 11:25:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:55,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:55,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:55,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash -139648455, now seen corresponding path program 1 times [2023-09-17 11:25:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:55,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104190331] [2023-09-17 11:25:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:25:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-17 11:25:55,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:25:55,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104190331] [2023-09-17 11:25:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104190331] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:25:55,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:25:55,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-17 11:25:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338140582] [2023-09-17 11:25:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:25:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:25:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-17 11:25:56,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-17 11:25:56,019 INFO L87 Difference]: Start difference. First operand 1098 states and 3071 transitions. cyclomatic complexity: 2068 Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:25:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:25:56,050 INFO L93 Difference]: Finished difference Result 1962 states and 5477 transitions. [2023-09-17 11:25:56,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1962 states and 5477 transitions. [2023-09-17 11:25:56,070 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 928 [2023-09-17 11:25:56,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1962 states to 1802 states and 5057 transitions. [2023-09-17 11:25:56,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1795 [2023-09-17 11:25:56,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1795 [2023-09-17 11:25:56,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1802 states and 5057 transitions. [2023-09-17 11:25:56,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:25:56,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1802 states and 5057 transitions. [2023-09-17 11:25:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states and 5057 transitions. [2023-09-17 11:25:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1450. [2023-09-17 11:25:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1450 states have (on average 2.8282758620689656) internal successors, (4101), 1449 states have internal predecessors, (4101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:25:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 4101 transitions. [2023-09-17 11:25:56,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1450 states and 4101 transitions. [2023-09-17 11:25:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-17 11:25:56,146 INFO L428 stractBuchiCegarLoop]: Abstraction has 1450 states and 4101 transitions. [2023-09-17 11:25:56,149 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-09-17 11:25:56,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1450 states and 4101 transitions. [2023-09-17 11:25:56,161 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 928 [2023-09-17 11:25:56,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:25:56,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:25:56,164 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:25:56,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:25:56,165 INFO L748 eck$LassoCheckResult]: Stem: 19523#[$Ultimate##0]don't care [261] $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] 19525#[L-1]don't care [270] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 20617#[L-1-1]don't care [345] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 20619#[L21]don't care [318] L21-->L21-1: Formula: (and (= (select |v_#length_9| 1) 2) (= (select |v_#valid_14| 1) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 20883#[L21-1]don't care [335] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_10| 1) 0)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 19637#[L21-2]don't care [276] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_11| 1) 1) 0) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 19639#[L21-3]don't care [309] L21-3-->L21-4: Formula: (and (= 30 (select |v_#length_10| 2)) (= (select |v_#valid_15| 2) 1)) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 20755#[L21-4]don't care [294] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 20181#[L42]don't care [283] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 20183#[L42-1]don't care [336] L42-1-->L42-2: Formula: (= v_~back~0_9 0) InVars {} OutVars{~back~0=v_~back~0_9} AuxVars[] AssignedVars[~back~0] 19741#[L42-2]don't care [292] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0] 19743#[L42-3]don't care [253] L42-3-->L-1-2: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 20445#[L-1-2]don't care [346] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 20891#[L-1-3]don't care [351] L-1-3-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_4|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 19415#[L80]don't care [243] L80-->L80-1: Formula: (and (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= (store |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_16|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 19417#[L80-1]don't care [333] L80-1-->L80-2: Formula: (and (= |v_#valid_18| (store |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_13|) (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 19959#[L80-2]don't care [250] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1] 20073#[L82]don't care [312] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 20557#[L82-1]don't care [244] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[~n~0] 20657#[L82-2]don't care [348] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 20685#[L83]don't care [254] L83-->L83-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 20687#[L83-1]don't care [298] L83-1-->L83-2: Formula: (= v_~front~0_6 |v_ULTIMATE.start_main_#t~nondet10#1_3|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 19187#[L83-2]don't care [328] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 19189#[L84]don't care [337] L84-->L85: Formula: (= v_~front~0_7 v_~back~0_10) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_10, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 20721#[L85]don't care [268] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 20723#[L85-1]don't care [280] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 19379#[L85-2]don't care [241] L85-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 19381#[L97]don't care [303] L97-->L98: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |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_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 20579#[L98]don't care [320] L98-->L98-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_1|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 20407#[L98-1]don't care [248] 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] 18903#[L37]don't care [284] 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] 18905#[L38]don't care [296] 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[] 20493#[L37-1]don't care [285] L37-1-->L99: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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] 20495#[L99]don't care [322] L99-->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] 20415#[L37-2]don't care [249] 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] 18757#[L38-3]don't care [266] 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[] 18759#[L37-3]don't care [262] L37-3-->L101: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 20103#[L101]don't care [341] L101-->L101-1: Formula: (and (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 1073741824)))) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 20841#[L101-1]don't care [251] L101-1-->L101-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 20843#[L101-2]don't care [308] L101-2-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 20135#[L102]don't care [274] L102-->L102-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 20137#[L102-6]don't care [256] L102-6-->L103: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[] 20691#[L103]don't care [338] L103-->L103-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 20125#[L103-1]don't care [271] L103-1-->L103-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 20127#[L103-2]don't care [317] L103-2-->L102-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 20749#[L102-3]don't care [286] L102-3-->L102-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 20725#[L102-4]don't care [269] L102-4-->L102-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 20339#[L102-5]don't care [342] L102-5-->L102-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 20341#[L102-6]don't care [257] L102-6-->L102-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[] 20689#[L102-7]don't care [282] L102-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 20973#[create_fresh_int_array_returnLabel#1]don't care [332] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base] 20983#[L85-3]don't care [325] L85-3-->L85-4: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 20969#[L85-4]don't care [277] L85-4-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base] 19111#[L88]don't care [314] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 19113#[L88-1]don't care [334] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 19213#[L88-2]don't care [246] L88-2-->L88-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre12#1_2|)) |v_#memory_int_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_7|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_6|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 20067#[L88-3]don't care [385] L88-3-->L52: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 20513#[L88-4, L52]don't care [352] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 19653#[L52, L88-5]don't care [353] L52-->L47: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 19655#[L47, L88-5]don't care [355] L47-->L47-1: Formula: (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_3| 256) 0) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[] 19053#[L47-1, L88-5]don't care [323] L88-5-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 20917#[L89, L47-1]don't care [301] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1] 20921#[L89-1, L47-1]don't care [279] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 20893#[L47-1, L89-2]don't care [307] L89-2-->L89-3: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre14#1_2|)) |v_#memory_int_8|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_9|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_8|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 19183#[L89-3, L47-1]don't care [388] L89-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_12|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~nondet4#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 18909#[L89-4, $Ultimate##0, L47-1]don't care [362] $Ultimate##0-->L60-5: Formula: (= |v_thread2Thread1of1ForFork1_~b~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~b~0#1] 20035#[L89-4, L60-5, L47-1]don't care [2023-09-17 11:25:56,166 INFO L750 eck$LassoCheckResult]: Loop: 20035#[L89-4, L60-5, L47-1]don't care [363] L60-5-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet4#1] 20681#[L89-4, L60-1, L47-1]don't care [366] L60-1-->L60-4: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_5| 256) 0)) InVars {thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_5|} AuxVars[] AssignedVars[] 19865#[L60-4, L89-4, L47-1]don't care [369] L60-4-->L61: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet4#1] 18517#[L89-4, L61, L47-1]don't care [371] L61-->L61-1: Formula: (= (ite (and (<= 0 v_~back~0_7) (< v_~back~0_7 v_~n~0_2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_7, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_7, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 18853#[L89-4, L61-1, L47-1]don't care [372] L61-1-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1] 18949#[L89-4, L37, L47-1]don't care [373] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1] 20153#[L89-4, L38, L47-1]don't care [375] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 20351#[L89-4, L37-1, L47-1]don't care [377] L37-1-->L62: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 19771#[L89-4, L62, L47-1]don't care [378] L62-->L63: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_3| 256) 0)) InVars {thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_3|} OutVars{thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_3|} AuxVars[] AssignedVars[] 20889#[L89-4, L63, L47-1]don't care [380] L63-->L71: Formula: (let ((.cse0 (* 4 v_~back~0_54))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_30))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~back~0_54 1) v_~back~0_53) (<= (+ .cse0 4 v_~queue~0.offset_30) (select |v_#length_39| v_~queue~0.base_30)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_36| v_~queue~0.base_30) .cse1) 1) 1 0)) (<= 0 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (select |v_#valid_44| v_~queue~0.base_30) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_30, #valid=|v_#valid_44|, ~back~0=v_~back~0_54, #memory_int=|v_#memory_int_36|, #length=|v_#length_39|, ~queue~0.base=v_~queue~0.base_30} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~queue~0.offset=v_~queue~0.offset_30, #valid=|v_#valid_44|, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_36|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, #length=|v_#length_39|, ~queue~0.base=v_~queue~0.base_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~back~0, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1] 20829#[L71, L89-4, L47-1]don't care [382] L71-->L60-5: Formula: (= |v_thread2Thread1of1ForFork1_~b~0#1_8| (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_7| 256) 0) 1 0) 0) 0 1)) InVars {thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_7|} OutVars{thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~b~0#1] 20035#[L89-4, L60-5, L47-1]don't care [2023-09-17 11:25:56,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:56,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1664644666, now seen corresponding path program 1 times [2023-09-17 11:25:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091981330] [2023-09-17 11:25:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:56,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:56,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:56,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash 458629491, now seen corresponding path program 1 times [2023-09-17 11:25:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:56,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312795222] [2023-09-17 11:25:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:56,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:56,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:56,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:56,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:25:56,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1645888102, now seen corresponding path program 1 times [2023-09-17 11:25:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:25:56,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143860691] [2023-09-17 11:25:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:25:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:25:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:56,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:25:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:25:56,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:25:58,297 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:25:58,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:25:58,298 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:25:58,298 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:25:58,298 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:25:58,298 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:58,298 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:25:58,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:25:58,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive-alt.wvr.c_BEv2_Iteration4_Lasso [2023-09-17 11:25:58,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:25:58,298 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:25:58,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:58,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:25:59,616 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:25:59,616 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:25:59,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-09-17 11:25:59,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:59,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:59,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,665 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-09-17 11:25:59,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:25:59,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:25:59,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:25:59,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,680 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-09-17 11:25:59,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:59,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:59,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,728 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:25:59,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:25:59,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:25:59,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-09-17 11:25:59,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,766 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:25:59,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:25:59,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:25:59,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-09-17 11:25:59,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,797 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-09-17 11:25:59,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:59,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:59,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,819 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-09-17 11:25:59,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:59,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:59,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,857 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-09-17 11:25:59,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:59,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:59,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,878 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-09-17 11:25:59,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:59,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:59,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:25:59,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-09-17 11:25:59,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,897 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-09-17 11:25:59,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:25:59,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:25:59,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:25:59,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:25:59,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:25:59,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:25:59,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:25:59,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:25:59,948 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-09-17 11:25:59,948 INFO L444 ModelExtractionUtils]: 14 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-09-17 11:25:59,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:25:59,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:25:59,953 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:25:59,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-09-17 11:25:59,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:25:59,980 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-17 11:25:59,981 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:25:59,981 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~queue~0.offset, ~back~0, v_rep(select #length ~queue~0.base)_1) = -1*~queue~0.offset - 4*~back~0 + 1*v_rep(select #length ~queue~0.base)_1 Supporting invariants [] [2023-09-17 11:25:59,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-09-17 11:26:00,061 INFO L156 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2023-09-17 11:26:00,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:26:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:26:00,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-17 11:26:00,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:26:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:26:00,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-17 11:26:00,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:26:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:26:00,271 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-09-17 11:26:00,271 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1450 states and 4101 transitions. cyclomatic complexity: 2732 Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:26:00,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1450 states and 4101 transitions. cyclomatic complexity: 2732. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 3076 states and 9022 transitions. Complement of second has 4 states. [2023-09-17 11:26:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-09-17 11:26:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:26:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2023-09-17 11:26:00,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 66 letters. Loop has 11 letters. [2023-09-17 11:26:00,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:26:00,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 77 letters. Loop has 11 letters. [2023-09-17 11:26:00,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:26:00,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 128 transitions. Stem has 66 letters. Loop has 22 letters. [2023-09-17 11:26:00,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:26:00,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3076 states and 9022 transitions. [2023-09-17 11:26:00,403 INFO L131 ngComponentsAnalysis]: Automaton has 136 accepting balls. 544 [2023-09-17 11:26:00,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3076 states to 1521 states and 4258 transitions. [2023-09-17 11:26:00,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 683 [2023-09-17 11:26:00,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 747 [2023-09-17 11:26:00,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1521 states and 4258 transitions. [2023-09-17 11:26:00,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:26:00,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1521 states and 4258 transitions. [2023-09-17 11:26:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states and 4258 transitions. [2023-09-17 11:26:00,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-09-17 11:26:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1457. [2023-09-17 11:26:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1457 states have (on average 2.796156485929993) internal successors, (4074), 1456 states have internal predecessors, (4074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:26:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 4074 transitions. [2023-09-17 11:26:00,468 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1457 states and 4074 transitions. [2023-09-17 11:26:00,468 INFO L428 stractBuchiCegarLoop]: Abstraction has 1457 states and 4074 transitions. [2023-09-17 11:26:00,468 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-09-17 11:26:00,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1457 states and 4074 transitions. [2023-09-17 11:26:00,480 INFO L131 ngComponentsAnalysis]: Automaton has 136 accepting balls. 544 [2023-09-17 11:26:00,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:26:00,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:26:00,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:26:00,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-09-17 11:26:00,484 INFO L748 eck$LassoCheckResult]: Stem: 26407#[$Ultimate##0]don't care [261] $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] 26409#[L-1]don't care [270] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 27149#[L-1-1]don't care [345] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 27057#[L21]don't care [318] L21-->L21-1: Formula: (and (= (select |v_#length_9| 1) 2) (= (select |v_#valid_14| 1) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 26815#[L21-1]don't care [335] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_10| 1) 0)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] 26519#[L21-2]don't care [276] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_11| 1) 1) 0) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 26521#[L21-3]don't care [309] L21-3-->L21-4: Formula: (and (= 30 (select |v_#length_10| 2)) (= (select |v_#valid_15| 2) 1)) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 25609#[L21-4]don't care [294] L21-4-->L42: Formula: (and (= v_~queue~0.base_5 0) (= v_~queue~0.offset_5 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_5, ~queue~0.offset=v_~queue~0.offset_5} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 25611#[L42]don't care [283] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 27009#[L42-1]don't care [336] L42-1-->L42-2: Formula: (= v_~back~0_9 0) InVars {} OutVars{~back~0=v_~back~0_9} AuxVars[] AssignedVars[~back~0] 26609#[L42-2]don't care [292] L42-2-->L42-3: Formula: (= v_~sum~0_4 0) InVars {} OutVars{~sum~0=v_~sum~0_4} AuxVars[] AssignedVars[~sum~0] 26611#[L42-3]don't care [253] L42-3-->L-1-2: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 27135#[L-1-2]don't care [346] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 26869#[L-1-3]don't care [351] L-1-3-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_4|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 26287#[L80]don't care [243] L80-->L80-1: Formula: (and (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= (store |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_16|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_16|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 26289#[L80-1]don't care [333] L80-1-->L80-2: Formula: (and (= |v_#valid_18| (store |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_13|) (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 26813#[L80-2]don't care [250] L80-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1] 26901#[L82]don't care [312] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 24947#[L82-1]don't care [244] L82-1-->L82-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[~n~0] 24949#[L82-2]don't care [348] L82-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 25127#[L83]don't care [254] L83-->L83-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 25129#[L83-1]don't care [298] L83-1-->L83-2: Formula: (= v_~front~0_6 |v_ULTIMATE.start_main_#t~nondet10#1_3|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 26077#[L83-2]don't care [328] L83-2-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 26079#[L84]don't care [337] L84-->L85: Formula: (= v_~front~0_7 v_~back~0_10) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_10, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 25325#[L85]don't care [268] L85-->L85-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} 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_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 25327#[L85-1]don't care [280] L85-1-->L85-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 26247#[L85-2]don't care [241] L85-2-->L97: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_4|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 26249#[L97]don't care [303] L97-->L98: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |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_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 27177#[L98]don't care [320] L98-->L98-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_1|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 27133#[L98-1]don't care [248] 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] 25541#[L37]don't care [284] 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] 25543#[L38]don't care [296] 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[] 27163#[L37-1]don't care [285] L37-1-->L99: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, 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] 26061#[L99]don't care [322] L99-->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] 26063#[L37-2]don't care [249] 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] 25321#[L38-3]don't care [266] 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[] 25323#[L37-3]don't care [262] L37-3-->L101: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26939#[L101]don't care [341] L101-->L101-1: Formula: (and (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_3| 1073741824)))) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 26351#[L101-1]don't care [251] L101-1-->L101-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 26353#[L101-2]don't care [308] L101-2-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 26971#[L102]don't care [274] L102-->L102-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 25131#[L102-6]don't care [256] L102-6-->L103: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[] 25133#[L103]don't care [338] L103-->L103-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 26965#[L103-1]don't care [271] L103-1-->L103-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|))) (and (<= 0 .cse0) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 26761#[L103-2]don't care [317] L103-2-->L102-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 25555#[L102-3]don't care [286] L102-3-->L102-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 25349#[L102-4]don't care [269] L102-4-->L102-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 25351#[L102-5]don't care [342] L102-5-->L102-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 27101#[L102-6]don't care [257] L102-6-->L102-7: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, 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_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} AuxVars[] AssignedVars[] 27159#[L102-7]don't care [282] L102-7-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 27161#[create_fresh_int_array_returnLabel#1]don't care [332] create_fresh_int_array_returnLabel#1-->L85-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret11#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_1|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base] 27205#[L85-3]don't care [325] L85-3-->L85-4: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret11#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11#1.base_2| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_2|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 27153#[L85-4]don't care [277] L85-4-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_3|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base] 25901#[L88]don't care [314] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 25903#[L88-1]don't care [334] L88-1-->L88-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 26101#[L88-2]don't care [246] L88-2-->L88-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre12#1_2|)) |v_#memory_int_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_7|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_6|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 26899#[L88-3]don't care [385] L88-3-->L52: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 27165#[L88-4, L52]don't care [352] L88-4-->L88-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 26545#[L52, L88-5]don't care [323] L88-5-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 26549#[L89, L52]don't care [301] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1] 26259#[L89-1, L52]don't care [279] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 25511#[L52, L89-2]don't care [307] L89-2-->L89-3: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre14#1_2|)) |v_#memory_int_8|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_9|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_8|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 25215#[L89-3, L52]don't care [388] L89-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_12|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~nondet4#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 25219#[L52, L89-4, $Ultimate##0]don't care [362] $Ultimate##0-->L60-5: Formula: (= |v_thread2Thread1of1ForFork1_~b~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~b~0#1] 27029#[L52, L89-4, L60-5]don't care [363] L60-5-->L60-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet4#1] 26541#[L52, L89-4, L60-1]don't care [366] L60-1-->L60-4: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_5| 256) 0)) InVars {thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_5|} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_5|} AuxVars[] AssignedVars[] 26543#[L52, L60-4, L89-4]don't care [369] L60-4-->L61: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet4#1] 27443#[L52, L89-4, L61]don't care [371] L61-->L61-1: Formula: (= (ite (and (<= 0 v_~back~0_7) (< v_~back~0_7 v_~n~0_2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {~back~0=v_~back~0_7, ~n~0=v_~n~0_2} OutVars{~back~0=v_~back~0_7, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 27361#[L52, L89-4, L61-1]don't care [372] L61-1-->L37: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1] 27355#[L52, L89-4, L37]don't care [373] L37-->L38: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1] 27353#[L52, L89-4, L38]don't care [375] L38-->L37-1: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 27349#[L52, L89-4, L37-1]don't care [377] L37-1-->L62: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26887#[L52, L89-4, L62]don't care [378] L62-->L63: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_3| 256) 0)) InVars {thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_3|} OutVars{thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_3|} AuxVars[] AssignedVars[] 26889#[L52, L89-4, L63]don't care [380] L63-->L71: Formula: (let ((.cse0 (* 4 v_~back~0_54))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_30))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (+ v_~back~0_54 1) v_~back~0_53) (<= (+ .cse0 4 v_~queue~0.offset_30) (select |v_#length_39| v_~queue~0.base_30)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_36| v_~queue~0.base_30) .cse1) 1) 1 0)) (<= 0 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (= (select |v_#valid_44| v_~queue~0.base_30) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_30, #valid=|v_#valid_44|, ~back~0=v_~back~0_54, #memory_int=|v_#memory_int_36|, #length=|v_#length_39|, ~queue~0.base=v_~queue~0.base_30} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~queue~0.offset=v_~queue~0.offset_30, #valid=|v_#valid_44|, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_36|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, #length=|v_#length_39|, ~queue~0.base=v_~queue~0.base_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~back~0, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1] 26851#[L52, L71, L89-4]don't care [353] L52-->L47: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 26227#[L71, L89-4, L47]don't care [2023-09-17 11:26:00,485 INFO L750 eck$LassoCheckResult]: Loop: 26227#[L71, L89-4, L47]don't care [356] L47-->L47-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_5| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_5|} AuxVars[] AssignedVars[] 26229#[L71, L89-4, L47-3]don't care [359] L47-3-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 26715#[L71, L89-4, L48]don't care [361] L48-->L52: Formula: (let ((.cse0 (* v_~front~0_33 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_22))) (and (<= (+ .cse0 4 v_~queue~0.offset_22) (select |v_#length_31| v_~queue~0.base_22)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~front~0_33 v_~n~0_12) (<= 0 v_~front~0_33) (< v_~front~0_33 v_~back~0_43)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~front~0_32 (+ v_~front~0_33 1)) (<= 0 .cse1) (= v_~sum~0_21 (+ v_~sum~0_22 (select (select |v_#memory_int_28| v_~queue~0.base_22) .cse1))) (= (select |v_#valid_36| v_~queue~0.base_22) 1)))) InVars {~sum~0=v_~sum~0_22, ~queue~0.offset=v_~queue~0.offset_22, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_28|, ~back~0=v_~back~0_43, #length=|v_#length_31|, ~queue~0.base=v_~queue~0.base_22, ~n~0=v_~n~0_12, ~front~0=v_~front~0_33} OutVars{~queue~0.offset=v_~queue~0.offset_22, ~back~0=v_~back~0_43, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_22, ~sum~0=v_~sum~0_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_28|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #length=|v_#length_31|, ~n~0=v_~n~0_12, ~front~0=v_~front~0_32} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~front~0] 26717#[L52, L71, L89-4]don't care [353] L52-->L47: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 26227#[L71, L89-4, L47]don't care [2023-09-17 11:26:00,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:26:00,485 INFO L85 PathProgramCache]: Analyzing trace with hash -310413729, now seen corresponding path program 1 times [2023-09-17 11:26:00,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:26:00,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334442419] [2023-09-17 11:26:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:26:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:26:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:26:00,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:26:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:26:00,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:26:00,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:26:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 11885660, now seen corresponding path program 3 times [2023-09-17 11:26:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:26:00,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578846280] [2023-09-17 11:26:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:26:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:26:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:26:00,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:26:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:26:00,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:26:00,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:26:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1699318854, now seen corresponding path program 1 times [2023-09-17 11:26:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:26:00,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906823068] [2023-09-17 11:26:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:26:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:26:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:26:00,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:26:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:26:00,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:26:02,642 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:26:02,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:26:02,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:26:02,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:26:02,644 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:26:02,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:26:02,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:26:02,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:26:02,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive-alt.wvr.c_BEv2_Iteration5_Lasso [2023-09-17 11:26:02,644 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:26:02,644 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:26:02,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:02,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:02,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:03,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:26:04,154 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:26:04,155 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:26:04,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:26:04,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:26:04,160 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:26:04,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-09-17 11:26:04,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:26:04,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:26:04,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:26:04,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:26:04,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:26:04,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:26:04,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:26:04,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:26:04,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-09-17 11:26:04,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:26:04,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:26:04,179 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:26:04,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-09-17 11:26:04,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:26:04,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:26:04,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:26:04,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:26:04,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:26:04,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:26:04,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:26:04,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:26:04,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:26:04,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-09-17 11:26:04,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:26:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:26:04,195 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:26:04,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-09-17 11:26:04,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:26:04,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:26:04,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:26:04,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:26:04,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:26:04,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:26:04,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:26:04,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:26:04,268 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2023-09-17 11:26:04,269 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 22 variables to zero. [2023-09-17 11:26:04,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:26:04,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:26:04,278 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:26:04,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-09-17 11:26:04,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:26:04,287 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-17 11:26:04,288 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:26:04,288 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~front~0) = 1*~n~0 - 1*~front~0 Supporting invariants [] [2023-09-17 11:26:04,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-09-17 11:26:04,379 INFO L156 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2023-09-17 11:26:04,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:26:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:26:04,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-17 11:26:04,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:26:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:26:04,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-17 11:26:04,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:26:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:26:04,575 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-09-17 11:26:04,575 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1457 states and 4074 transitions. cyclomatic complexity: 2762 Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:26:04,643 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1457 states and 4074 transitions. cyclomatic complexity: 2762. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 5027 states and 16118 transitions. Complement of second has 4 states. [2023-09-17 11:26:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-09-17 11:26:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:26:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-09-17 11:26:04,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 75 letters. Loop has 4 letters. [2023-09-17 11:26:04,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:26:04,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 79 letters. Loop has 4 letters. [2023-09-17 11:26:04,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:26:04,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 75 letters. Loop has 8 letters. [2023-09-17 11:26:04,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:26:04,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5027 states and 16118 transitions. [2023-09-17 11:26:04,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:26:04,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5027 states to 0 states and 0 transitions. [2023-09-17 11:26:04,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 11:26:04,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 11:26:04,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 11:26:04,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:26:04,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:26:04,705 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:26:04,705 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:26:04,705 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-09-17 11:26:04,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 11:26:04,705 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:26:04,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 11:26:04,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:26:04 BoogieIcfgContainer [2023-09-17 11:26:04,716 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:26:04,717 INFO L158 Benchmark]: Toolchain (without parser) took 15221.07ms. Allocated memory was 294.6MB in the beginning and 431.0MB in the end (delta: 136.3MB). Free memory was 242.8MB in the beginning and 222.9MB in the end (delta: 19.9MB). Peak memory consumption was 157.2MB. Max. memory is 8.0GB. [2023-09-17 11:26:04,717 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:26:04,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.54ms. Allocated memory is still 294.6MB. Free memory was 242.3MB in the beginning and 231.1MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 11:26:04,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.47ms. Allocated memory is still 294.6MB. Free memory was 231.1MB in the beginning and 229.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 11:26:04,717 INFO L158 Benchmark]: Boogie Preprocessor took 41.50ms. Allocated memory is still 294.6MB. Free memory was 229.1MB in the beginning and 227.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:26:04,718 INFO L158 Benchmark]: RCFGBuilder took 501.99ms. Allocated memory is still 294.6MB. Free memory was 227.6MB in the beginning and 204.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-09-17 11:26:04,718 INFO L158 Benchmark]: BuchiAutomizer took 14421.31ms. Allocated memory was 294.6MB in the beginning and 431.0MB in the end (delta: 136.3MB). Free memory was 204.5MB in the beginning and 222.9MB in the end (delta: -18.3MB). Peak memory consumption was 119.5MB. Max. memory is 8.0GB. [2023-09-17 11:26:04,719 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.12ms. Allocated memory is still 191.9MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.54ms. Allocated memory is still 294.6MB. Free memory was 242.3MB in the beginning and 231.1MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.47ms. Allocated memory is still 294.6MB. Free memory was 231.1MB in the beginning and 229.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.50ms. Allocated memory is still 294.6MB. Free memory was 229.1MB in the beginning and 227.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 501.99ms. Allocated memory is still 294.6MB. Free memory was 227.6MB in the beginning and 204.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 14421.31ms. Allocated memory was 294.6MB in the beginning and 431.0MB in the end (delta: 136.3MB). Free memory was 204.5MB in the beginning and 222.9MB in the end (delta: -18.3MB). Peak memory consumption was 119.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[arr] + -4 * i and consists of 9 locations. One deterministic module has affine ranking function unknown-#length-unknown[queue] + -4 * back + -1 * queue and consists of 3 locations. One deterministic module has affine ranking function -1 * front + n and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 11.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 422 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 880 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 878 mSDsluCounter, 1253 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 777 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 476 mSDtfsCounter, 248 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital293 mio100 ax111 hnf100 lsp75 ukn73 mio100 lsp37 div181 bol100 ite100 ukn100 eq157 hnf93 smp72 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms 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 11:26:04,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-09-17 11:26:04,940 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...