/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/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:14:44,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:14:44,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:14:44,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:14:44,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:14:44,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:14:44,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:14:44,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:14:44,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:14:44,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:14:44,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:14:44,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:14:44,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:14:44,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:14:44,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:14:44,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:14:44,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:14:44,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:14:44,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:14:44,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:14:44,649 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:14:44,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:14:44,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:14:44,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:14:44,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:14:44,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:14:44,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:14:44,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:14:44,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:14:44,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:14:44,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:14:44,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:14:44,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:14:44,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:14:44,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:14:44,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:14:44,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:14:44,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:14:44,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:14:44,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:14:44,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:14:44,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:14:44,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:14:44,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:14:44,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:14:44,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:14:44,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:14:44,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:14:44,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:14:44,690 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:14:44,690 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:14:44,691 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:14:44,691 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:14:44,691 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:14:44,691 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:14:44,691 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:14:44,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:14:44,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:14:44,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:14:44,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:14:44,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:14:44,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:14:44,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:14:44,693 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:14:44,694 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:14:44,694 INFO L138 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 [2022-07-26 14:14:44,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:14:44,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:14:44,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:14:44,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:14:44,915 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:14:44,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2022-07-26 14:14:44,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac83611a/3be73f047a2944eba21d606a14b396fa/FLAG733544078 [2022-07-26 14:14:45,243 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:14:45,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2022-07-26 14:14:45,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac83611a/3be73f047a2944eba21d606a14b396fa/FLAG733544078 [2022-07-26 14:14:45,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac83611a/3be73f047a2944eba21d606a14b396fa [2022-07-26 14:14:45,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:14:45,696 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:14:45,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:14:45,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:14:45,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:14:45,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:45,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe21de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45, skipping insertion in model container [2022-07-26 14:14:45,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:45,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:14:45,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:14:45,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3182,3195] [2022-07-26 14:14:45,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:14:45,952 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:14:45,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3182,3195] [2022-07-26 14:14:45,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:14:45,992 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:14:45,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45 WrapperNode [2022-07-26 14:14:45,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:14:45,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:14:45,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:14:45,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:14:45,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,043 INFO L137 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 352 [2022-07-26 14:14:46,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:14:46,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:14:46,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:14:46,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:14:46,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:14:46,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:14:46,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:14:46,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:14:46,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (1/1) ... [2022-07-26 14:14:46,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:46,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:14:46,101 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) [2022-07-26 14:14:46,116 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 [2022-07-26 14:14:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:14:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-26 14:14:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:14:46,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:14:46,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-26 14:14:46,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:14:46,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:14:46,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:14:46,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:14:46,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:14:46,131 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:14:46,202 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:14:46,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:14:46,581 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:14:46,744 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:14:46,745 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-26 14:14:46,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:14:46 BoogieIcfgContainer [2022-07-26 14:14:46,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:14:46,748 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:14:46,748 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:14:46,751 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:14:46,751 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:14:46,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:14:45" (1/3) ... [2022-07-26 14:14:46,752 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fac942a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:14:46, skipping insertion in model container [2022-07-26 14:14:46,752 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:14:46,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:14:45" (2/3) ... [2022-07-26 14:14:46,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fac942a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:14:46, skipping insertion in model container [2022-07-26 14:14:46,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:14:46,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:14:46" (3/3) ... [2022-07-26 14:14:46,754 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2022-07-26 14:14:46,861 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-26 14:14:46,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 319 places, 347 transitions, 718 flow [2022-07-26 14:14:46,965 INFO L129 PetriNetUnfolder]: 35/341 cut-off events. [2022-07-26 14:14:46,965 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 14:14:46,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 341 events. 35/341 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 656 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 273. Up to 2 conditions per place. [2022-07-26 14:14:46,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 319 places, 347 transitions, 718 flow [2022-07-26 14:14:46,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 316 places, 341 transitions, 700 flow [2022-07-26 14:14:46,988 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:14:46,994 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 316 places, 341 transitions, 700 flow [2022-07-26 14:14:46,995 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 316 places, 341 transitions, 700 flow [2022-07-26 14:14:46,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 316 places, 341 transitions, 700 flow [2022-07-26 14:14:47,050 INFO L129 PetriNetUnfolder]: 35/341 cut-off events. [2022-07-26 14:14:47,050 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 14:14:47,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 341 events. 35/341 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 659 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 273. Up to 2 conditions per place. [2022-07-26 14:14:47,060 INFO L116 LiptonReduction]: Number of co-enabled transitions 13038 [2022-07-26 14:14:58,877 INFO L131 LiptonReduction]: Checked pairs total: 15140 [2022-07-26 14:14:58,878 INFO L133 LiptonReduction]: Total number of compositions: 393 [2022-07-26 14:14:58,895 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:14:58,898 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:14:58,898 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:14:58,899 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:14:58,899 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:14:58,899 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:14:58,899 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:14:58,900 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:14:58,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:14:59,012 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 418 [2022-07-26 14:14:59,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:14:59,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:14:59,022 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:14:59,022 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:14:59,023 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:14:59,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 461 states, but on-demand construction may add more states [2022-07-26 14:14:59,037 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 418 [2022-07-26 14:14:59,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:14:59,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:14:59,038 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:14:59,038 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:14:59,041 INFO L733 eck$LassoCheckResult]: Stem: 322#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 325#[L120-6]don't care [2022-07-26 14:14:59,041 INFO L735 eck$LassoCheckResult]: Loop: 325#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 325#[L120-6]don't care [2022-07-26 14:14:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 1 times [2022-07-26 14:14:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:59,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893647030] [2022-07-26 14:14:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:59,178 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:59,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:59,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1533, now seen corresponding path program 1 times [2022-07-26 14:14:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:59,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972561135] [2022-07-26 14:14:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:59,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:59,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:14:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 51784, now seen corresponding path program 1 times [2022-07-26 14:14:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:14:59,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082090928] [2022-07-26 14:14:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:14:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:14:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:59,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:14:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:14:59,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:14:59,742 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:14:59,742 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:14:59,742 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:14:59,742 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:14:59,742 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:14:59,742 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:14:59,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:14:59,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:14:59,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-dot-product-alt.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:14:59,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:14:59,743 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:14:59,758 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:59,770 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:59,771 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:59,773 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:59,775 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:59,776 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:59,778 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:14:59,779 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,108 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,109 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,111 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,113 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,115 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,116 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,117 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,131 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,132 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,134 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,135 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,136 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,137 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,139 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,140 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,142 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,144 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,145 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,146 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,148 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,149 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,150 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,152 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,153 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,155 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,156 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,157 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,158 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,159 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,161 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,162 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,163 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,165 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,166 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,167 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,169 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,171 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,172 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,173 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,176 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,177 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,178 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,179 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,181 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,182 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:00,636 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:00,639 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:00,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:00,656 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) [2022-07-26 14:15:00,659 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 [2022-07-26 14:15:00,662 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 [2022-07-26 14:15:00,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:00,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:00,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:00,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:00,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:00,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:00,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:00,701 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 [2022-07-26 14:15:00,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:00,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:00,705 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) [2022-07-26 14:15:00,706 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 [2022-07-26 14:15:00,707 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 [2022-07-26 14:15:00,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:00,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:00,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:00,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:00,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:00,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:00,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:00,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:00,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:00,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:00,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:00,734 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) [2022-07-26 14:15:00,735 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 [2022-07-26 14:15:00,737 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 [2022-07-26 14:15:00,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:00,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:00,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:00,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:00,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:00,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:00,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:00,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-26 14:15:00,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:00,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:00,799 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) [2022-07-26 14:15:00,801 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 [2022-07-26 14:15:00,802 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 [2022-07-26 14:15:00,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:00,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:00,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:00,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:00,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:00,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:00,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:00,855 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 [2022-07-26 14:15:00,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:00,857 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) [2022-07-26 14:15:00,858 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 [2022-07-26 14:15:00,859 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 [2022-07-26 14:15:00,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:00,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:00,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:00,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:00,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:00,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:00,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:00,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:00,898 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 [2022-07-26 14:15:00,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:00,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:00,900 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) [2022-07-26 14:15:00,900 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 [2022-07-26 14:15:00,902 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 [2022-07-26 14:15:00,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:00,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:00,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:00,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:00,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:00,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:00,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:00,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:00,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-26 14:15:00,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:00,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:00,932 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) [2022-07-26 14:15:00,932 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 [2022-07-26 14:15:00,933 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 [2022-07-26 14:15:00,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:00,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:00,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:00,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:00,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:00,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:00,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:00,975 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 [2022-07-26 14:15:00,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:00,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:00,977 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) [2022-07-26 14:15:00,978 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 [2022-07-26 14:15:00,979 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 [2022-07-26 14:15:00,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:00,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:00,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:00,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:00,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:00,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:01,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:01,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-26 14:15:01,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:01,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:01,019 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) [2022-07-26 14:15:01,020 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 [2022-07-26 14:15:01,021 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 [2022-07-26 14:15:01,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:01,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:01,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:01,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:01,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:01,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:01,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:01,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-26 14:15:01,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:01,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:01,060 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) [2022-07-26 14:15:01,067 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 [2022-07-26 14:15:01,077 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 [2022-07-26 14:15:01,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:01,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:01,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:01,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:01,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:01,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:01,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:01,114 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-26 14:15:01,114 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-26 14:15:01,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:01,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:01,116 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) [2022-07-26 14:15:01,117 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 [2022-07-26 14:15:01,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:01,136 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:15:01,136 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:01,136 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~4#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-26 14:15:01,176 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 [2022-07-26 14:15:01,225 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-26 14:15:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:01,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:15:01,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:01,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:15:01,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:01,321 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:15:01,322 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 461 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-26 14:15:01,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 461 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 464 states and 1745 transitions. Complement of second has 3 states. [2022-07-26 14:15:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-26 14:15:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-26 14:15:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-26 14:15:01,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:15:01,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:01,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:15:01,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:01,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:15:01,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:01,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 464 states and 1745 transitions. [2022-07-26 14:15:01,417 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 417 [2022-07-26 14:15:01,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 464 states to 456 states and 1726 transitions. [2022-07-26 14:15:01,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2022-07-26 14:15:01,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2022-07-26 14:15:01,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 456 states and 1726 transitions. [2022-07-26 14:15:01,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:01,447 INFO L220 hiAutomatonCegarLoop]: Abstraction has 456 states and 1726 transitions. [2022-07-26 14:15:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states and 1726 transitions. [2022-07-26 14:15:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 455. [2022-07-26 14:15:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 455 states have (on average 3.789010989010989) internal successors, (1724), 454 states have internal predecessors, (1724), 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) [2022-07-26 14:15:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1724 transitions. [2022-07-26 14:15:01,515 INFO L242 hiAutomatonCegarLoop]: Abstraction has 455 states and 1724 transitions. [2022-07-26 14:15:01,515 INFO L426 stractBuchiCegarLoop]: Abstraction has 455 states and 1724 transitions. [2022-07-26 14:15:01,515 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:15:01,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 1724 transitions. [2022-07-26 14:15:01,520 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 417 [2022-07-26 14:15:01,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:01,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:01,521 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-26 14:15:01,521 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:01,522 INFO L733 eck$LassoCheckResult]: Stem: 2721#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2637#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2639#[L120-14]don't care [2022-07-26 14:15:01,522 INFO L735 eck$LassoCheckResult]: Loop: 2639#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 2639#[L120-14]don't care [2022-07-26 14:15:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash 51869, now seen corresponding path program 1 times [2022-07-26 14:15:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:01,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744308543] [2022-07-26 14:15:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:01,558 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:01,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1518, now seen corresponding path program 1 times [2022-07-26 14:15:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:01,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723802823] [2022-07-26 14:15:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:01,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:01,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1609426, now seen corresponding path program 1 times [2022-07-26 14:15:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:01,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161370501] [2022-07-26 14:15:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:01,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161370501] [2022-07-26 14:15:01,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161370501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:01,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:01,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:15:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139960890] [2022-07-26 14:15:01,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:01,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:01,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:15:01,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:15:01,749 INFO L87 Difference]: Start difference. First operand 455 states and 1724 transitions. cyclomatic complexity: 1334 Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-26 14:15:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:01,851 INFO L93 Difference]: Finished difference Result 459 states and 1610 transitions. [2022-07-26 14:15:01,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 459 states and 1610 transitions. [2022-07-26 14:15:01,856 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 419 [2022-07-26 14:15:01,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 459 states to 459 states and 1610 transitions. [2022-07-26 14:15:01,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2022-07-26 14:15:01,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 458 [2022-07-26 14:15:01,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 1610 transitions. [2022-07-26 14:15:01,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:01,865 INFO L220 hiAutomatonCegarLoop]: Abstraction has 459 states and 1610 transitions. [2022-07-26 14:15:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 1610 transitions. [2022-07-26 14:15:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2022-07-26 14:15:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 459 states have (on average 3.5076252723311545) internal successors, (1610), 458 states have internal predecessors, (1610), 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) [2022-07-26 14:15:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1610 transitions. [2022-07-26 14:15:01,881 INFO L242 hiAutomatonCegarLoop]: Abstraction has 459 states and 1610 transitions. [2022-07-26 14:15:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:15:01,882 INFO L426 stractBuchiCegarLoop]: Abstraction has 459 states and 1610 transitions. [2022-07-26 14:15:01,882 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:15:01,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 459 states and 1610 transitions. [2022-07-26 14:15:01,885 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 419 [2022-07-26 14:15:01,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:01,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:01,885 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:15:01,885 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:15:01,885 INFO L733 eck$LassoCheckResult]: Stem: 4105#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4009#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4011#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3887#[L95-6]don't care [2022-07-26 14:15:01,886 INFO L735 eck$LassoCheckResult]: Loop: 3887#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3883#[L120-22]don't care [1544] L120-22-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~3#1_51| 4))) (let ((.cse0 (+ v_~mult~0.offset_79 .cse1))) (and (= (store |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|)) |v_#memory_$Pointer$.offset_146|) (<= 0 .cse0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_154|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|) (= (store |v_#memory_int_284| v_~mult~0.base_79 (store (select |v_#memory_int_284| v_~mult~0.base_79) .cse0 (select (select |v_#memory_int_283| v_~mult~0.base_79) .cse0))) |v_#memory_int_283|) (<= (+ v_~mult~0.offset_79 4 .cse1) (select |v_#length_361| v_~mult~0.base_79)) (= (select |v_#valid_408| v_~mult~0.base_79) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|) (= |v_ULTIMATE.start_main_~i~3#1_50| (+ |v_ULTIMATE.start_main_~i~3#1_51| 1)) (= (store |v_#memory_$Pointer$.base_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.base_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|)) |v_#memory_$Pointer$.base_146|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_147|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.base=v_~mult~0.base_79, ~mult~0.offset=v_~mult~0.offset_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_284|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_147|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_51|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_27|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_146|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.offset=v_~mult~0.offset_79, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_27|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_25|, ~mult~0.base=v_~mult~0.base_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_283|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_146|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_50|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret48#1.base, #memory_$Pointer$.base, ULTIMATE.start_main_#t~ret48#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~i~3#1] 3887#[L95-6]don't care [2022-07-26 14:15:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1609520, now seen corresponding path program 1 times [2022-07-26 14:15:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:01,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162130068] [2022-07-26 14:15:01,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:01,923 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:01,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:01,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash 51485, now seen corresponding path program 1 times [2022-07-26 14:15:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:01,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568454183] [2022-07-26 14:15:01,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:01,954 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:01,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1546799244, now seen corresponding path program 1 times [2022-07-26 14:15:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:01,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562864294] [2022-07-26 14:15:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:02,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:02,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:03,112 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 [2022-07-26 14:15:04,285 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:04,285 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:04,285 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:04,285 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:04,285 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:04,285 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:04,285 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:04,285 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:04,285 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-dot-product-alt.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 14:15:04,285 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:04,285 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:04,304 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,311 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,312 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,314 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,316 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,317 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,323 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,325 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,326 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,327 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,329 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,333 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,334 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,335 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,336 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,351 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,353 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,354 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,356 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,358 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,360 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,362 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,364 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,940 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,945 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,947 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,948 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,949 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,951 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,952 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,954 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,955 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,957 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,959 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,961 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,962 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,963 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,965 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,966 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,970 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,971 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,973 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,974 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:04,975 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:05,672 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:05,672 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:05,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,674 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) [2022-07-26 14:15:05,675 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 [2022-07-26 14:15:05,676 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 [2022-07-26 14:15:05,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:05,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:05,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:05,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:05,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:05,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:05,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:05,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:05,702 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 [2022-07-26 14:15:05,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,703 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) [2022-07-26 14:15:05,704 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 [2022-07-26 14:15:05,705 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 [2022-07-26 14:15:05,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:05,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:05,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:05,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:05,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:05,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:05,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:05,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:05,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-26 14:15:05,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,727 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) [2022-07-26 14:15:05,728 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 [2022-07-26 14:15:05,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:05,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:05,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:05,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:05,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:05,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:05,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:05,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:05,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-26 14:15:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,768 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) [2022-07-26 14:15:05,769 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 [2022-07-26 14:15:05,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:05,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:05,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:05,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:05,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:05,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:05,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:05,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:05,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-26 14:15:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,808 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) [2022-07-26 14:15:05,809 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 [2022-07-26 14:15:05,810 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 [2022-07-26 14:15:05,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:05,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:05,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:05,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:05,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:05,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:05,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:05,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:05,856 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 [2022-07-26 14:15:05,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,858 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) [2022-07-26 14:15:05,859 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 [2022-07-26 14:15:05,865 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 [2022-07-26 14:15:05,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:05,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:05,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:05,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:05,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:05,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:05,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:05,902 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 [2022-07-26 14:15:05,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,903 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) [2022-07-26 14:15:05,904 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 [2022-07-26 14:15:05,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:05,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:05,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:05,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:05,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:05,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:05,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:05,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:05,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:05,941 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 [2022-07-26 14:15:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,942 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) [2022-07-26 14:15:05,944 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 [2022-07-26 14:15:05,944 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 [2022-07-26 14:15:05,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:05,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:05,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:05,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:05,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:05,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:05,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:05,994 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 [2022-07-26 14:15:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:05,995 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) [2022-07-26 14:15:06,001 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 [2022-07-26 14:15:06,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,027 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 [2022-07-26 14:15:06,042 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 [2022-07-26 14:15:06,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,043 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) [2022-07-26 14:15:06,044 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 [2022-07-26 14:15:06,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:06,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-26 14:15:06,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,083 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) [2022-07-26 14:15:06,084 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 [2022-07-26 14:15:06,085 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 [2022-07-26 14:15:06,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,114 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 [2022-07-26 14:15:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,120 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-26 14:15:06,126 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 [2022-07-26 14:15:06,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,153 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-26 14:15:06,157 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 [2022-07-26 14:15:06,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,184 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-26 14:15:06,186 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 [2022-07-26 14:15:06,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,210 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-26 14:15:06,212 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 [2022-07-26 14:15:06,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,259 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-26 14:15:06,261 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 [2022-07-26 14:15:06,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,297 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-26 14:15:06,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:06,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,353 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-26 14:15:06,356 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 [2022-07-26 14:15:06,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,393 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 14:15:06,395 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 [2022-07-26 14:15:06,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,429 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,432 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 [2022-07-26 14:15:06,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 14:15:06,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,459 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 14:15:06,461 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 [2022-07-26 14:15:06,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-26 14:15:06,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,485 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 14:15:06,487 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 [2022-07-26 14:15:06,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 14:15:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,530 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 14:15:06,532 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 [2022-07-26 14:15:06,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-26 14:15:06,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,569 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 14:15:06,571 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 [2022-07-26 14:15:06,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 14:15:06,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,618 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,655 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 [2022-07-26 14:15:06,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 14:15:06,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 14:15:06,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,694 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 14:15:06,695 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 [2022-07-26 14:15:06,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:06,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:06,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:06,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-26 14:15:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,733 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-26 14:15:06,735 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 [2022-07-26 14:15:06,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-26 14:15:06,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,773 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-26 14:15:06,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:06,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-26 14:15:06,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,803 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-26 14:15:06,805 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 [2022-07-26 14:15:06,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-26 14:15:06,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,831 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-26 14:15:06,832 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 [2022-07-26 14:15:06,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-26 14:15:06,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,872 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-26 14:15:06,874 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 [2022-07-26 14:15:06,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-26 14:15:06,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,912 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-26 14:15:06,914 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 [2022-07-26 14:15:06,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,940 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-26 14:15:06,949 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 [2022-07-26 14:15:06,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:06,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:06,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:06,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:06,975 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:06,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-26 14:15:06,976 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 [2022-07-26 14:15:06,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:06,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:06,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:06,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:06,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:06,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:06,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:07,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,016 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-26 14:15:07,018 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 [2022-07-26 14:15:07,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,024 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2022-07-26 14:15:07,024 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 14:15:07,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,050 INFO L401 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2022-07-26 14:15:07,051 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 14:15:07,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:07,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,104 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-26 14:15:07,106 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 [2022-07-26 14:15:07,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:07,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:07,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:07,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:07,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,131 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-26 14:15:07,133 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 [2022-07-26 14:15:07,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:07,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:07,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:07,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:07,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-26 14:15:07,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,160 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-26 14:15:07,161 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 [2022-07-26 14:15:07,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:07,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:07,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:07,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:07,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-26 14:15:07,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,187 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-26 14:15:07,189 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 [2022-07-26 14:15:07,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:07,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:07,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:07,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:07,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-26 14:15:07,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,227 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-26 14:15:07,233 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 [2022-07-26 14:15:07,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:07,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:07,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:07,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:07,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:07,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,268 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-26 14:15:07,270 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 [2022-07-26 14:15:07,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:07,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:07,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:07,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:07,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-26 14:15:07,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,295 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-26 14:15:07,297 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 [2022-07-26 14:15:07,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:07,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:07,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:07,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:07,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:07,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:07,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:07,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,334 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-26 14:15:07,335 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 [2022-07-26 14:15:07,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:07,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:07,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:07,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:07,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:07,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:07,360 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:07,368 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-26 14:15:07,368 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-07-26 14:15:07,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:07,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:07,369 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:07,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-26 14:15:07,371 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:07,392 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:15:07,392 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:07,392 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~3#1, ~maxA~0) = -1*ULTIMATE.start_main_~i~3#1 + 1*~maxA~0 Supporting invariants [] [2022-07-26 14:15:07,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-26 14:15:07,490 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-26 14:15:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:07,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:15:07,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:07,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:15:07,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:07,535 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 [2022-07-26 14:15:07,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 459 states and 1610 transitions. cyclomatic complexity: 1217 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-26 14:15:07,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 459 states and 1610 transitions. cyclomatic complexity: 1217. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 913 states and 3215 transitions. Complement of second has 6 states. [2022-07-26 14:15:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-26 14:15:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-26 14:15:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-07-26 14:15:07,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-26 14:15:07,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:07,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-26 14:15:07,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:07,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-26 14:15:07,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:07,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 3215 transitions. [2022-07-26 14:15:07,646 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 416 [2022-07-26 14:15:07,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 464 states and 1620 transitions. [2022-07-26 14:15:07,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2022-07-26 14:15:07,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 459 [2022-07-26 14:15:07,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 464 states and 1620 transitions. [2022-07-26 14:15:07,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:15:07,651 INFO L220 hiAutomatonCegarLoop]: Abstraction has 464 states and 1620 transitions. [2022-07-26 14:15:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states and 1620 transitions. [2022-07-26 14:15:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 462. [2022-07-26 14:15:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 462 states have (on average 3.502164502164502) internal successors, (1618), 461 states have internal predecessors, (1618), 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) [2022-07-26 14:15:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1618 transitions. [2022-07-26 14:15:07,660 INFO L242 hiAutomatonCegarLoop]: Abstraction has 462 states and 1618 transitions. [2022-07-26 14:15:07,660 INFO L426 stractBuchiCegarLoop]: Abstraction has 462 states and 1618 transitions. [2022-07-26 14:15:07,660 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:15:07,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 462 states and 1618 transitions. [2022-07-26 14:15:07,663 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 416 [2022-07-26 14:15:07,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:07,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:07,663 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:15:07,663 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:07,664 INFO L733 eck$LassoCheckResult]: Stem: 6093#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5997#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5999#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5977#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5867#[L120-22]don't care [2022-07-26 14:15:07,664 INFO L735 eck$LassoCheckResult]: Loop: 5867#[L120-22]don't care [1478] L120-22-->L120-22: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|))) (and (= (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.offset_102|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79| 4) (select |v_#length_273| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|)) (= (select |v_#valid_302| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) 1) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.base_102|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|) (<= 0 .cse0) (= |v_#memory_int_215| (store |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|)))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_103|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_216|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_103|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_102|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_55|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_215|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_102|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 5867#[L120-22]don't care [2022-07-26 14:15:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 49896700, now seen corresponding path program 1 times [2022-07-26 14:15:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:07,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350907216] [2022-07-26 14:15:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:07,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:07,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1509, now seen corresponding path program 1 times [2022-07-26 14:15:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:07,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891689895] [2022-07-26 14:15:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:07,728 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:07,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:07,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1546799178, now seen corresponding path program 1 times [2022-07-26 14:15:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:07,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857879261] [2022-07-26 14:15:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:07,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:07,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:10,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:10,185 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:10,185 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:10,185 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:10,185 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:10,185 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:10,185 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:10,185 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:10,185 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:10,185 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-dot-product-alt.wvr.c_BEv2_Iteration4_Lasso [2022-07-26 14:15:10,185 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:10,185 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:10,188 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,198 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,200 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,203 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,204 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,205 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,207 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,208 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,766 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,768 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,769 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,771 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,772 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,774 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,775 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,777 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,778 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,779 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,781 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,782 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,784 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,785 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,786 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,788 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,789 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,791 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,792 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,793 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,794 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,796 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,797 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,803 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,804 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,805 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,807 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,809 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,810 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,812 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,813 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,814 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,815 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,817 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,818 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,820 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,821 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,823 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:10,824 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:11,573 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:11,574 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:11,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,580 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-26 14:15:11,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:11,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:11,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:11,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:11,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:11,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,620 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-26 14:15:11,622 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 [2022-07-26 14:15:11,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:11,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:11,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:11,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-26 14:15:11,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,664 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-26 14:15:11,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:11,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:11,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:11,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-26 14:15:11,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,706 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-26 14:15:11,708 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 [2022-07-26 14:15:11,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:11,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:11,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:11,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-26 14:15:11,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,745 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-26 14:15:11,747 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 [2022-07-26 14:15:11,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:11,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:11,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:11,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-26 14:15:11,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,792 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-26 14:15:11,852 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 [2022-07-26 14:15:11,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:11,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:11,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:11,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,878 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-26 14:15:11,880 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 [2022-07-26 14:15:11,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:11,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:11,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:11,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-26 14:15:11,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,903 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-26 14:15:11,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:11,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:11,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:11,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-26 14:15:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,944 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-26 14:15:11,945 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 [2022-07-26 14:15:11,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:11,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:11,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:11,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-26 14:15:11,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:11,984 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:11,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-26 14:15:11,986 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 [2022-07-26 14:15:11,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:11,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:11,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:11,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:11,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:11,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:12,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:12,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:12,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:12,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:12,025 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:12,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-26 14:15:12,026 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 [2022-07-26 14:15:12,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:12,033 INFO L203 nArgumentSynthesizer]: 16 stem disjuncts [2022-07-26 14:15:12,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:12,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:12,048 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2022-07-26 14:15:12,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:12,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:12,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-26 14:15:12,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:12,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:12,086 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:12,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-26 14:15:12,088 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 [2022-07-26 14:15:12,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:12,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:12,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:12,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:12,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:12,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:12,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:12,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-26 14:15:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:12,127 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:12,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-26 14:15:12,129 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 [2022-07-26 14:15:12,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:12,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:12,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:12,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:12,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:12,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:12,147 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:12,165 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 14:15:12,165 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-26 14:15:12,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:12,166 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:12,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-26 14:15:12,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:12,188 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:15:12,188 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:12,188 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~4#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_3) = -4*ULTIMATE.start_create_fresh_int_array_~i~4#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_3 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset >= 0] [2022-07-26 14:15:12,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-26 14:15:12,318 INFO L156 tatePredicateManager]: 44 out of 45 supporting invariants were superfluous and have been removed [2022-07-26 14:15:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:12,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-26 14:15:12,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:12,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:15:12,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:12,378 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:15:12,378 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 462 states and 1618 transitions. cyclomatic complexity: 1223 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-07-26 14:15:12,479 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 462 states and 1618 transitions. cyclomatic complexity: 1223. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 1817 states and 6411 transitions. Complement of second has 5 states. [2022-07-26 14:15:12,479 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 [2022-07-26 14:15:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-07-26 14:15:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-07-26 14:15:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-26 14:15:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-26 14:15:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-26 14:15:12,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:12,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1817 states and 6411 transitions. [2022-07-26 14:15:12,494 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 1244 [2022-07-26 14:15:12,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1817 states to 1364 states and 4811 transitions. [2022-07-26 14:15:12,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1355 [2022-07-26 14:15:12,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1355 [2022-07-26 14:15:12,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1364 states and 4811 transitions. [2022-07-26 14:15:12,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:15:12,507 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1364 states and 4811 transitions. [2022-07-26 14:15:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states and 4811 transitions. [2022-07-26 14:15:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 462. [2022-07-26 14:15:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 462 states have (on average 3.497835497835498) internal successors, (1616), 461 states have internal predecessors, (1616), 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) [2022-07-26 14:15:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1616 transitions. [2022-07-26 14:15:12,521 INFO L242 hiAutomatonCegarLoop]: Abstraction has 462 states and 1616 transitions. [2022-07-26 14:15:12,521 INFO L426 stractBuchiCegarLoop]: Abstraction has 462 states and 1616 transitions. [2022-07-26 14:15:12,521 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:15:12,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 462 states and 1616 transitions. [2022-07-26 14:15:12,524 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 416 [2022-07-26 14:15:12,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:12,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:12,524 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:15:12,524 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:12,524 INFO L733 eck$LassoCheckResult]: Stem: 9053#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8957#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 8961#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8963#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 9055#[L120-14]don't care [2022-07-26 14:15:12,525 INFO L735 eck$LassoCheckResult]: Loop: 9055#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 9055#[L120-14]don't care [2022-07-26 14:15:12,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:12,525 INFO L85 PathProgramCache]: Analyzing trace with hash 49815108, now seen corresponding path program 1 times [2022-07-26 14:15:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:12,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364457579] [2022-07-26 14:15:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:12,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:12,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1518, now seen corresponding path program 2 times [2022-07-26 14:15:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:12,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20337786] [2022-07-26 14:15:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:12,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:12,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:12,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1544269835, now seen corresponding path program 2 times [2022-07-26 14:15:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:12,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790485080] [2022-07-26 14:15:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:12,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:12,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790485080] [2022-07-26 14:15:12,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790485080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:15:12,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866477640] [2022-07-26 14:15:12,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-26 14:15:12,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:15:12,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:12,691 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:15:12,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-07-26 14:15:12,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-26 14:15:12,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-26 14:15:12,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-26 14:15:12,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:12,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:15:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:12,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866477640] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:15:12,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:15:12,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-07-26 14:15:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132843783] [2022-07-26 14:15:12,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:15:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:12,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-26 14:15:12,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-26 14:15:12,933 INFO L87 Difference]: Start difference. First operand 462 states and 1616 transitions. cyclomatic complexity: 1221 Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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) [2022-07-26 14:15:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:13,330 INFO L93 Difference]: Finished difference Result 1825 states and 6425 transitions. [2022-07-26 14:15:13,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1825 states and 6425 transitions. [2022-07-26 14:15:13,343 INFO L131 ngComponentsAnalysis]: Automaton has 250 accepting balls. 1658 [2022-07-26 14:15:13,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1825 states to 1825 states and 6425 transitions. [2022-07-26 14:15:13,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1813 [2022-07-26 14:15:13,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1813 [2022-07-26 14:15:13,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1825 states and 6425 transitions. [2022-07-26 14:15:13,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:15:13,358 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1825 states and 6425 transitions. [2022-07-26 14:15:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states and 6425 transitions. [2022-07-26 14:15:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 465. [2022-07-26 14:15:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 465 states have (on average 3.486021505376344) internal successors, (1621), 464 states have internal predecessors, (1621), 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) [2022-07-26 14:15:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1621 transitions. [2022-07-26 14:15:13,374 INFO L242 hiAutomatonCegarLoop]: Abstraction has 465 states and 1621 transitions. [2022-07-26 14:15:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-26 14:15:13,375 INFO L426 stractBuchiCegarLoop]: Abstraction has 465 states and 1621 transitions. [2022-07-26 14:15:13,375 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:15:13,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 1621 transitions. [2022-07-26 14:15:13,378 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 416 [2022-07-26 14:15:13,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:13,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:13,378 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2022-07-26 14:15:13,378 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:13,379 INFO L733 eck$LassoCheckResult]: Stem: 11866#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 11764#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 11768#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 11772#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 11868#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 11870#[L120-14]don't care [2022-07-26 14:15:13,379 INFO L735 eck$LassoCheckResult]: Loop: 11870#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 11870#[L120-14]don't care [2022-07-26 14:15:13,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1544191250, now seen corresponding path program 3 times [2022-07-26 14:15:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:13,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365627471] [2022-07-26 14:15:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:13,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:13,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1518, now seen corresponding path program 3 times [2022-07-26 14:15:13,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:13,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145276831] [2022-07-26 14:15:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:13,402 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:13,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 625289981, now seen corresponding path program 4 times [2022-07-26 14:15:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:13,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871528422] [2022-07-26 14:15:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:13,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:13,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:16,290 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:16,290 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:16,290 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:16,290 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:16,290 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:16,290 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:16,290 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:16,290 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:16,290 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-dot-product-alt.wvr.c_BEv2_Iteration6_Lasso [2022-07-26 14:15:16,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:16,291 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:16,293 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,298 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,299 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,301 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,302 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,303 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,305 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,306 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,309 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,311 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,312 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,313 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,315 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,316 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,317 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,319 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,870 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,871 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,873 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,874 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,875 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,877 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,878 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,880 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,881 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,883 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,884 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,885 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,886 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,888 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,889 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,890 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,892 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,893 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,894 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,895 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,897 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,898 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,900 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,902 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,906 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,910 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,911 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,912 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,923 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,924 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,926 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,927 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,943 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,945 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:16,947 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:17,441 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:17,442 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:17,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,443 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:17,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-26 14:15:17,445 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 [2022-07-26 14:15:17,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:17,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:17,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-26 14:15:17,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,495 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:17,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-26 14:15:17,497 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 [2022-07-26 14:15:17,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:17,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,522 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2022-07-26 14:15:17,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-26 14:15:17,524 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 [2022-07-26 14:15:17,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:17,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:17,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-26 14:15:17,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,549 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2022-07-26 14:15:17,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-26 14:15:17,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:17,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-26 14:15:17,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,581 INFO L229 MonitoredProcess]: Starting monitored process 76 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) [2022-07-26 14:15:17,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-26 14:15:17,583 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 [2022-07-26 14:15:17,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-26 14:15:17,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,621 INFO L229 MonitoredProcess]: Starting monitored process 77 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) [2022-07-26 14:15:17,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-26 14:15:17,623 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 [2022-07-26 14:15:17,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:17,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:17,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-26 14:15:17,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,649 INFO L229 MonitoredProcess]: Starting monitored process 78 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) [2022-07-26 14:15:17,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-26 14:15:17,651 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 [2022-07-26 14:15:17,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:17,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,674 INFO L229 MonitoredProcess]: Starting monitored process 79 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) [2022-07-26 14:15:17,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-26 14:15:17,678 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 [2022-07-26 14:15:17,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:17,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:17,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:17,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,706 INFO L229 MonitoredProcess]: Starting monitored process 80 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) [2022-07-26 14:15:17,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-26 14:15:17,708 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 [2022-07-26 14:15:17,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,733 INFO L229 MonitoredProcess]: Starting monitored process 81 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) [2022-07-26 14:15:17,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-26 14:15:17,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 [2022-07-26 14:15:17,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:17,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:17,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:17,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,762 INFO L229 MonitoredProcess]: Starting monitored process 82 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) [2022-07-26 14:15:17,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-26 14:15:17,764 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 [2022-07-26 14:15:17,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-26 14:15:17,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,789 INFO L229 MonitoredProcess]: Starting monitored process 83 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) [2022-07-26 14:15:17,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-26 14:15:17,790 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 [2022-07-26 14:15:17,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:17,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:17,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-26 14:15:17,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,822 INFO L229 MonitoredProcess]: Starting monitored process 84 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) [2022-07-26 14:15:17,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-26 14:15:17,824 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 [2022-07-26 14:15:17,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-26 14:15:17,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,858 INFO L229 MonitoredProcess]: Starting monitored process 85 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) [2022-07-26 14:15:17,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-26 14:15:17,859 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 [2022-07-26 14:15:17,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:17,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,907 INFO L229 MonitoredProcess]: Starting monitored process 86 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) [2022-07-26 14:15:17,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-26 14:15:17,909 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 [2022-07-26 14:15:17,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:17,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:17,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:17,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:17,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:17,946 INFO L229 MonitoredProcess]: Starting monitored process 87 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) [2022-07-26 14:15:17,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-26 14:15:17,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:17,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:17,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:17,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:17,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:17,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:17,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:17,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:17,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:17,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,007 INFO L229 MonitoredProcess]: Starting monitored process 88 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) [2022-07-26 14:15:18,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-26 14:15:18,009 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 [2022-07-26 14:15:18,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:18,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,047 INFO L229 MonitoredProcess]: Starting monitored process 89 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) [2022-07-26 14:15:18,057 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 [2022-07-26 14:15:18,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-26 14:15:18,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:18,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,099 INFO L229 MonitoredProcess]: Starting monitored process 90 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) [2022-07-26 14:15:18,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-26 14:15:18,101 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 [2022-07-26 14:15:18,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:18,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,152 INFO L229 MonitoredProcess]: Starting monitored process 91 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) [2022-07-26 14:15:18,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 [2022-07-26 14:15:18,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-26 14:15:18,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:18,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,202 INFO L229 MonitoredProcess]: Starting monitored process 92 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) [2022-07-26 14:15:18,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-26 14:15:18,204 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 [2022-07-26 14:15:18,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:18,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:18,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:18,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-26 14:15:18,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,228 INFO L229 MonitoredProcess]: Starting monitored process 93 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) [2022-07-26 14:15:18,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-26 14:15:18,229 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 [2022-07-26 14:15:18,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-26 14:15:18,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,258 INFO L229 MonitoredProcess]: Starting monitored process 94 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) [2022-07-26 14:15:18,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-26 14:15:18,260 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 [2022-07-26 14:15:18,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,287 INFO L229 MonitoredProcess]: Starting monitored process 95 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) [2022-07-26 14:15:18,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-26 14:15:18,289 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 [2022-07-26 14:15:18,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:18,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,326 INFO L229 MonitoredProcess]: Starting monitored process 96 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) [2022-07-26 14:15:18,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-26 14:15:18,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:18,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:18,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,367 INFO L229 MonitoredProcess]: Starting monitored process 97 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) [2022-07-26 14:15:18,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-26 14:15:18,371 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 [2022-07-26 14:15:18,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:18,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:18,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:18,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-26 14:15:18,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,393 INFO L229 MonitoredProcess]: Starting monitored process 98 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) [2022-07-26 14:15:18,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-26 14:15:18,395 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 [2022-07-26 14:15:18,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-26 14:15:18,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,420 INFO L229 MonitoredProcess]: Starting monitored process 99 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) [2022-07-26 14:15:18,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-26 14:15:18,422 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 [2022-07-26 14:15:18,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-26 14:15:18,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,447 INFO L229 MonitoredProcess]: Starting monitored process 100 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) [2022-07-26 14:15:18,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-26 14:15:18,449 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 [2022-07-26 14:15:18,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:18,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:18,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:18,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-26 14:15:18,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,472 INFO L229 MonitoredProcess]: Starting monitored process 101 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) [2022-07-26 14:15:18,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-26 14:15:18,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:18,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:18,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-07-26 14:15:18,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,499 INFO L229 MonitoredProcess]: Starting monitored process 102 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) [2022-07-26 14:15:18,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-26 14:15:18,501 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 [2022-07-26 14:15:18,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:18,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:18,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:18,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:18,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:18,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:18,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:18,555 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-26 14:15:18,555 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-26 14:15:18,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:18,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,556 INFO L229 MonitoredProcess]: Starting monitored process 103 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) [2022-07-26 14:15:18,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-26 14:15:18,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:18,564 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:15:18,564 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:18,564 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~4#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_4) = -4*ULTIMATE.start_create_fresh_int_array_~i~4#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_4 Supporting invariants [] [2022-07-26 14:15:18,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-26 14:15:18,669 INFO L156 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2022-07-26 14:15:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:18,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:15:18,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:18,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-26 14:15:18,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:18,726 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2022-07-26 14:15:18,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 465 states and 1621 transitions. cyclomatic complexity: 1223 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-26 14:15:18,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 465 states and 1621 transitions. cyclomatic complexity: 1223. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 918 states and 3222 transitions. Complement of second has 4 states. [2022-07-26 14:15:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-26 14:15:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-26 14:15:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-07-26 14:15:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-26 14:15:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-26 14:15:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-26 14:15:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:18,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 918 states and 3222 transitions. [2022-07-26 14:15:18,797 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 830 [2022-07-26 14:15:18,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 918 states to 918 states and 3222 transitions. [2022-07-26 14:15:18,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 908 [2022-07-26 14:15:18,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 908 [2022-07-26 14:15:18,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 918 states and 3222 transitions. [2022-07-26 14:15:18,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:15:18,805 INFO L220 hiAutomatonCegarLoop]: Abstraction has 918 states and 3222 transitions. [2022-07-26 14:15:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states and 3222 transitions. [2022-07-26 14:15:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 466. [2022-07-26 14:15:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 466 states have (on average 3.482832618025751) internal successors, (1623), 465 states have internal predecessors, (1623), 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) [2022-07-26 14:15:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1623 transitions. [2022-07-26 14:15:18,816 INFO L242 hiAutomatonCegarLoop]: Abstraction has 466 states and 1623 transitions. [2022-07-26 14:15:18,816 INFO L426 stractBuchiCegarLoop]: Abstraction has 466 states and 1623 transitions. [2022-07-26 14:15:18,816 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 14:15:18,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 466 states and 1623 transitions. [2022-07-26 14:15:18,819 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 415 [2022-07-26 14:15:18,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:18,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:18,820 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2022-07-26 14:15:18,820 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:18,821 INFO L733 eck$LassoCheckResult]: Stem: 13903#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 13801#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 13803#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 13775#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 13671#[L120-22]don't care [1544] L120-22-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~3#1_51| 4))) (let ((.cse0 (+ v_~mult~0.offset_79 .cse1))) (and (= (store |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|)) |v_#memory_$Pointer$.offset_146|) (<= 0 .cse0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_154|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|) (= (store |v_#memory_int_284| v_~mult~0.base_79 (store (select |v_#memory_int_284| v_~mult~0.base_79) .cse0 (select (select |v_#memory_int_283| v_~mult~0.base_79) .cse0))) |v_#memory_int_283|) (<= (+ v_~mult~0.offset_79 4 .cse1) (select |v_#length_361| v_~mult~0.base_79)) (= (select |v_#valid_408| v_~mult~0.base_79) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|) (= |v_ULTIMATE.start_main_~i~3#1_50| (+ |v_ULTIMATE.start_main_~i~3#1_51| 1)) (= (store |v_#memory_$Pointer$.base_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.base_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|)) |v_#memory_$Pointer$.base_146|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_147|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.base=v_~mult~0.base_79, ~mult~0.offset=v_~mult~0.offset_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_284|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_147|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_51|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_27|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_146|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.offset=v_~mult~0.offset_79, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_27|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_25|, ~mult~0.base=v_~mult~0.base_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_283|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_146|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_50|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret48#1.base, #memory_$Pointer$.base, ULTIMATE.start_main_#t~ret48#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~i~3#1] 13675#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 13669#[L120-22]don't care [2022-07-26 14:15:18,821 INFO L735 eck$LassoCheckResult]: Loop: 13669#[L120-22]don't care [1478] L120-22-->L120-22: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|))) (and (= (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.offset_102|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79| 4) (select |v_#length_273| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|)) (= (select |v_#valid_302| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) 1) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.base_102|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|) (<= 0 .cse0) (= |v_#memory_int_215| (store |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|)))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_103|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_216|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_103|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_102|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_55|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_215|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_102|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 13669#[L120-22]don't care [2022-07-26 14:15:18,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:18,821 INFO L85 PathProgramCache]: Analyzing trace with hash 706137888, now seen corresponding path program 2 times [2022-07-26 14:15:18,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:18,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956810569] [2022-07-26 14:15:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:18,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:18,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1509, now seen corresponding path program 2 times [2022-07-26 14:15:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:18,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752212828] [2022-07-26 14:15:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:18,866 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:18,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 415439526, now seen corresponding path program 1 times [2022-07-26 14:15:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:18,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360866535] [2022-07-26 14:15:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:18,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:18,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360866535] [2022-07-26 14:15:18,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360866535] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:15:18,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596052460] [2022-07-26 14:15:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:18,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:15:18,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:18,913 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:15:18,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-07-26 14:15:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:19,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:15:19,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:19,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:15:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:19,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596052460] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:15:19,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:15:19,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-26 14:15:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791287170] [2022-07-26 14:15:19,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:15:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:19,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-26 14:15:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-26 14:15:19,118 INFO L87 Difference]: Start difference. First operand 466 states and 1623 transitions. cyclomatic complexity: 1224 Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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) [2022-07-26 14:15:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:19,246 INFO L93 Difference]: Finished difference Result 921 states and 3110 transitions. [2022-07-26 14:15:19,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 921 states and 3110 transitions. [2022-07-26 14:15:19,252 INFO L131 ngComponentsAnalysis]: Automaton has 111 accepting balls. 815 [2022-07-26 14:15:19,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 921 states to 904 states and 3071 transitions. [2022-07-26 14:15:19,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 894 [2022-07-26 14:15:19,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 894 [2022-07-26 14:15:19,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 904 states and 3071 transitions. [2022-07-26 14:15:19,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:15:19,260 INFO L220 hiAutomatonCegarLoop]: Abstraction has 904 states and 3071 transitions. [2022-07-26 14:15:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states and 3071 transitions. [2022-07-26 14:15:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 795. [2022-07-26 14:15:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 795 states have (on average 3.4918238993710693) internal successors, (2776), 794 states have internal predecessors, (2776), 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) [2022-07-26 14:15:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2776 transitions. [2022-07-26 14:15:19,276 INFO L242 hiAutomatonCegarLoop]: Abstraction has 795 states and 2776 transitions. [2022-07-26 14:15:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-26 14:15:19,278 INFO L426 stractBuchiCegarLoop]: Abstraction has 795 states and 2776 transitions. [2022-07-26 14:15:19,278 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-26 14:15:19,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 795 states and 2776 transitions. [2022-07-26 14:15:19,282 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 715 [2022-07-26 14:15:19,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:19,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:19,282 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-26 14:15:19,282 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:19,282 INFO L733 eck$LassoCheckResult]: Stem: 16066#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15830#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15832#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15798#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15656#[L120-22]don't care [1478] L120-22-->L120-22: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|))) (and (= (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.offset_102|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79| 4) (select |v_#length_273| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|)) (= (select |v_#valid_302| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) 1) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.base_102|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|) (<= 0 .cse0) (= |v_#memory_int_215| (store |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|)))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_103|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_216|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_103|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_102|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_55|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_215|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_102|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 15658#[L120-22]don't care [1544] L120-22-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~3#1_51| 4))) (let ((.cse0 (+ v_~mult~0.offset_79 .cse1))) (and (= (store |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|)) |v_#memory_$Pointer$.offset_146|) (<= 0 .cse0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_154|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|) (= (store |v_#memory_int_284| v_~mult~0.base_79 (store (select |v_#memory_int_284| v_~mult~0.base_79) .cse0 (select (select |v_#memory_int_283| v_~mult~0.base_79) .cse0))) |v_#memory_int_283|) (<= (+ v_~mult~0.offset_79 4 .cse1) (select |v_#length_361| v_~mult~0.base_79)) (= (select |v_#valid_408| v_~mult~0.base_79) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|) (= |v_ULTIMATE.start_main_~i~3#1_50| (+ |v_ULTIMATE.start_main_~i~3#1_51| 1)) (= (store |v_#memory_$Pointer$.base_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.base_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|)) |v_#memory_$Pointer$.base_146|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_147|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.base=v_~mult~0.base_79, ~mult~0.offset=v_~mult~0.offset_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_284|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_147|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_51|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_27|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_146|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.offset=v_~mult~0.offset_79, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_27|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_25|, ~mult~0.base=v_~mult~0.base_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_283|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_146|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_50|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret48#1.base, #memory_$Pointer$.base, ULTIMATE.start_main_#t~ret48#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~i~3#1] 16474#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15654#[L120-22]don't care [2022-07-26 14:15:19,283 INFO L735 eck$LassoCheckResult]: Loop: 15654#[L120-22]don't care [1478] L120-22-->L120-22: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|))) (and (= (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.offset_102|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79| 4) (select |v_#length_273| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|)) (= (select |v_#valid_302| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) 1) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.base_102|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|) (<= 0 .cse0) (= |v_#memory_int_215| (store |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|)))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_103|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_216|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_103|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_102|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_55|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_215|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_102|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 15654#[L120-22]don't care [2022-07-26 14:15:19,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:19,283 INFO L85 PathProgramCache]: Analyzing trace with hash 415375086, now seen corresponding path program 2 times [2022-07-26 14:15:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:19,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749724228] [2022-07-26 14:15:19,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:19,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:19,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1509, now seen corresponding path program 3 times [2022-07-26 14:15:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:19,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306341265] [2022-07-26 14:15:19,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:19,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:19,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:19,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash -8272744, now seen corresponding path program 3 times [2022-07-26 14:15:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:19,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250582462] [2022-07-26 14:15:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:19,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:19,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:19,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:24,925 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:24,926 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:24,926 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:24,926 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:24,926 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:24,926 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:24,926 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:24,926 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:24,926 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-dot-product-alt.wvr.c_BEv2_Iteration8_Lasso [2022-07-26 14:15:24,926 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:24,926 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:24,928 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:24,930 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:24,931 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:24,932 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:24,934 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,823 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,824 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,825 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,826 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,827 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,828 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,829 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,830 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,831 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,832 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,833 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,834 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,835 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,835 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,837 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,838 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,839 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,840 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,841 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,842 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,843 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,843 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,845 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,845 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,846 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,847 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,848 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,849 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,850 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,851 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,852 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,853 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,854 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,855 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,856 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,857 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,858 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,859 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,860 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,860 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:25,863 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:27,136 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:27,136 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:27,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,138 INFO L229 MonitoredProcess]: Starting monitored process 105 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) [2022-07-26 14:15:27,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-26 14:15:27,140 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 [2022-07-26 14:15:27,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,174 INFO L229 MonitoredProcess]: Starting monitored process 106 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) [2022-07-26 14:15:27,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-26 14:15:27,176 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 [2022-07-26 14:15:27,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,224 INFO L229 MonitoredProcess]: Starting monitored process 107 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) [2022-07-26 14:15:27,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-26 14:15:27,227 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 [2022-07-26 14:15:27,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,273 INFO L229 MonitoredProcess]: Starting monitored process 108 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) [2022-07-26 14:15:27,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-26 14:15:27,276 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 [2022-07-26 14:15:27,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,324 INFO L229 MonitoredProcess]: Starting monitored process 109 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) [2022-07-26 14:15:27,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-26 14:15:27,326 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 [2022-07-26 14:15:27,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,367 INFO L229 MonitoredProcess]: Starting monitored process 110 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) [2022-07-26 14:15:27,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-26 14:15:27,370 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 [2022-07-26 14:15:27,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-26 14:15:27,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,396 INFO L229 MonitoredProcess]: Starting monitored process 111 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) [2022-07-26 14:15:27,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-26 14:15:27,398 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 [2022-07-26 14:15:27,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-26 14:15:27,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,422 INFO L229 MonitoredProcess]: Starting monitored process 112 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) [2022-07-26 14:15:27,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-26 14:15:27,424 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 [2022-07-26 14:15:27,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-26 14:15:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,461 INFO L229 MonitoredProcess]: Starting monitored process 113 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) [2022-07-26 14:15:27,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-26 14:15:27,464 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 [2022-07-26 14:15:27,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-26 14:15:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,488 INFO L229 MonitoredProcess]: Starting monitored process 114 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) [2022-07-26 14:15:27,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-26 14:15:27,490 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 [2022-07-26 14:15:27,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-26 14:15:27,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,535 INFO L229 MonitoredProcess]: Starting monitored process 115 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) [2022-07-26 14:15:27,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-26 14:15:27,537 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 [2022-07-26 14:15:27,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-26 14:15:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,562 INFO L229 MonitoredProcess]: Starting monitored process 116 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) [2022-07-26 14:15:27,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-26 14:15:27,564 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 [2022-07-26 14:15:27,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-26 14:15:27,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,602 INFO L229 MonitoredProcess]: Starting monitored process 117 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) [2022-07-26 14:15:27,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-26 14:15:27,603 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 [2022-07-26 14:15:27,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-26 14:15:27,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,631 INFO L229 MonitoredProcess]: Starting monitored process 118 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) [2022-07-26 14:15:27,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-26 14:15:27,633 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 [2022-07-26 14:15:27,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-07-26 14:15:27,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,657 INFO L229 MonitoredProcess]: Starting monitored process 119 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) [2022-07-26 14:15:27,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-26 14:15:27,658 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 [2022-07-26 14:15:27,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-07-26 14:15:27,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,696 INFO L229 MonitoredProcess]: Starting monitored process 120 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) [2022-07-26 14:15:27,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-26 14:15:27,698 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 [2022-07-26 14:15:27,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,704 INFO L203 nArgumentSynthesizer]: 32 stem disjuncts [2022-07-26 14:15:27,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,744 INFO L401 nArgumentSynthesizer]: We have 68 Motzkin's Theorem applications. [2022-07-26 14:15:27,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,812 INFO L229 MonitoredProcess]: Starting monitored process 121 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) [2022-07-26 14:15:27,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-07-26 14:15:27,814 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 [2022-07-26 14:15:27,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,853 INFO L229 MonitoredProcess]: Starting monitored process 122 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) [2022-07-26 14:15:27,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-26 14:15:27,854 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 [2022-07-26 14:15:27,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,877 INFO L229 MonitoredProcess]: Starting monitored process 123 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) [2022-07-26 14:15:27,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-26 14:15:27,879 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 [2022-07-26 14:15:27,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-07-26 14:15:27,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,903 INFO L229 MonitoredProcess]: Starting monitored process 124 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) [2022-07-26 14:15:27,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-26 14:15:27,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,939 INFO L229 MonitoredProcess]: Starting monitored process 125 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) [2022-07-26 14:15:27,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-26 14:15:27,941 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 [2022-07-26 14:15:27,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-26 14:15:27,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,966 INFO L229 MonitoredProcess]: Starting monitored process 126 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) [2022-07-26 14:15:27,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-26 14:15:27,968 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 [2022-07-26 14:15:27,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2022-07-26 14:15:27,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,992 INFO L229 MonitoredProcess]: Starting monitored process 127 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) [2022-07-26 14:15:27,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-26 14:15:27,994 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 [2022-07-26 14:15:27,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:28,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:28,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:28,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:28,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:28,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:28,019 INFO L229 MonitoredProcess]: Starting monitored process 128 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) [2022-07-26 14:15:28,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-26 14:15:28,022 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 [2022-07-26 14:15:28,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:28,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:28,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:28,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:28,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:28,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:28,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:28,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:28,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2022-07-26 14:15:28,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:28,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:28,045 INFO L229 MonitoredProcess]: Starting monitored process 129 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) [2022-07-26 14:15:28,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-26 14:15:28,047 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 [2022-07-26 14:15:28,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:28,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:28,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:28,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:28,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:28,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:28,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:28,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-07-26 14:15:28,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:28,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:28,072 INFO L229 MonitoredProcess]: Starting monitored process 130 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) [2022-07-26 14:15:28,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-26 14:15:28,073 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 [2022-07-26 14:15:28,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:28,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:28,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:28,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:28,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:28,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:28,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:28,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:28,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:28,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:28,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:28,096 INFO L229 MonitoredProcess]: Starting monitored process 131 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) [2022-07-26 14:15:28,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-26 14:15:28,099 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 [2022-07-26 14:15:28,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:28,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:28,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:28,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:28,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:28,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:28,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:28,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2022-07-26 14:15:28,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:28,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:28,123 INFO L229 MonitoredProcess]: Starting monitored process 132 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) [2022-07-26 14:15:28,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-26 14:15:28,125 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 [2022-07-26 14:15:28,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:28,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:28,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:28,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:28,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:28,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:28,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:28,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:28,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-07-26 14:15:28,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:28,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:28,162 INFO L229 MonitoredProcess]: Starting monitored process 133 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) [2022-07-26 14:15:28,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-26 14:15:28,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 [2022-07-26 14:15:28,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:28,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:28,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:28,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:28,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:28,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:28,189 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:28,216 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 14:15:28,216 INFO L444 ModelExtractionUtils]: 12 out of 37 variables were initially zero. Simplification set additionally 21 variables to zero. [2022-07-26 14:15:28,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:28,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:28,217 INFO L229 MonitoredProcess]: Starting monitored process 134 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) [2022-07-26 14:15:28,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-26 14:15:28,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:28,224 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:15:28,225 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:28,225 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~4#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_5) = -4*ULTIMATE.start_create_fresh_int_array_~i~4#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_5 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset >= 0] [2022-07-26 14:15:28,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:28,378 INFO L156 tatePredicateManager]: 46 out of 47 supporting invariants were superfluous and have been removed [2022-07-26 14:15:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:28,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-26 14:15:28,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:28,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:15:28,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:28,446 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:15:28,446 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 795 states and 2776 transitions. cyclomatic complexity: 2084 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-07-26 14:15:28,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:28,599 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 795 states and 2776 transitions. cyclomatic complexity: 2084. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 2802 states and 9870 transitions. Complement of second has 5 states. [2022-07-26 14:15:28,599 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 [2022-07-26 14:15:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-07-26 14:15:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-07-26 14:15:28,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-26 14:15:28,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:28,600 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-26 14:15:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:28,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-26 14:15:28,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:28,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:15:28,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:28,676 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:15:28,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 795 states and 2776 transitions. cyclomatic complexity: 2084 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-07-26 14:15:28,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 795 states and 2776 transitions. cyclomatic complexity: 2084. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 2802 states and 9870 transitions. Complement of second has 5 states. [2022-07-26 14:15:28,762 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 [2022-07-26 14:15:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-07-26 14:15:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-07-26 14:15:28,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 68 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-26 14:15:28,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:28,763 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-26 14:15:28,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:28,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-26 14:15:28,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:28,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:15:28,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:28,836 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:15:28,836 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 795 states and 2776 transitions. cyclomatic complexity: 2084 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-07-26 14:15:28,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 795 states and 2776 transitions. cyclomatic complexity: 2084. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 2023 states and 7119 transitions. Complement of second has 4 states. [2022-07-26 14:15:28,927 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 [2022-07-26 14:15:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-07-26 14:15:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-07-26 14:15:28,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-26 14:15:28,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:28,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-26 14:15:28,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:28,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-26 14:15:28,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:28,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2023 states and 7119 transitions. [2022-07-26 14:15:28,941 INFO L131 ngComponentsAnalysis]: Automaton has 160 accepting balls. 1128 [2022-07-26 14:15:28,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2023 states to 1243 states and 4367 transitions. [2022-07-26 14:15:28,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1233 [2022-07-26 14:15:28,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1233 [2022-07-26 14:15:28,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1243 states and 4367 transitions. [2022-07-26 14:15:28,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:28,953 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1243 states and 4367 transitions. [2022-07-26 14:15:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states and 4367 transitions. [2022-07-26 14:15:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 793. [2022-07-26 14:15:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 793 states have (on average 3.4955863808322825) internal successors, (2772), 792 states have internal predecessors, (2772), 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) [2022-07-26 14:15:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2772 transitions. [2022-07-26 14:15:28,971 INFO L242 hiAutomatonCegarLoop]: Abstraction has 793 states and 2772 transitions. [2022-07-26 14:15:28,971 INFO L426 stractBuchiCegarLoop]: Abstraction has 793 states and 2772 transitions. [2022-07-26 14:15:28,971 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-26 14:15:28,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 793 states and 2772 transitions. [2022-07-26 14:15:28,975 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 714 [2022-07-26 14:15:28,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:28,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:28,976 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:28,976 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 14:15:28,976 INFO L733 eck$LassoCheckResult]: Stem: 25388#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 25228#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 25232#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 25234#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 25332#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 25200#[L95-6]don't care [1546] L95-6-->L102-3: Formula: (and (= (ite (and (<= 0 v_~M~0_In_3) (< v_~M~0_In_3 v_~N~0_In_5)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (store |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.offset_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))) |v_#memory_$Pointer$.offset_Out_2|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (not (< |v_ULTIMATE.start_main_~i~3#1_In_3| v_~maxA~0_In_3)) (= (store |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#memory_$Pointer$.base_Out_2| (store |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.base_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_In_1|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_In_1|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_Out_2|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 24714#[L102-3]don't care [1196] L102-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork2_thidvar0_2 |v_ULTIMATE.start_main_#t~pre49#1_6|) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_4|, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_4|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_8|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_14|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_8|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_8|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_4|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_8|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_4|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_14|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_14|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_8|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_22|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 24716#[thread1ENTRY, L102-4]don't care [1065] thread1ENTRY-->L50-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] 25566#[L50-4, L102-4]don't care [2022-07-26 14:15:28,977 INFO L735 eck$LassoCheckResult]: Loop: 25566#[L50-4, L102-4]don't care [1538] L50-4-->L51-12: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_59| 4))) (let ((.cse0 (+ v_~A~0.offset_104 .cse1))) (and (not |v_thread1Thread1of1ForFork2_#t~short6#1_41|) (= (select |v_#valid_400| v_~A~0.base_104) 1) (not (<= 0 |v_thread1Thread1of1ForFork2_#t~mem2#1_27|)) (not |v_thread1Thread1of1ForFork2_#t~short4#1_43|) (= (select (select |v_#memory_int_275| v_~A~0.base_104) .cse0) |v_thread1Thread1of1ForFork2_#t~mem2#1_27|) (< |v_thread1Thread1of1ForFork2_~i~0#1_59| v_~N~0_64) (<= 0 .cse0) (<= (+ v_~A~0.offset_104 4 .cse1) (select |v_#length_353| v_~A~0.base_104)) (not |v_thread1Thread1of1ForFork2_#t~short8#1_47|) (= |v_thread1Thread1of1ForFork2_#t~mem5#1_29| |v_thread1Thread1of1ForFork2_#t~mem5#1_30|)))) InVars {~A~0.base=v_~A~0.base_104, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_30|, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_59|, #valid=|v_#valid_400|, #memory_int=|v_#memory_int_275|, #length=|v_#length_353|, ~N~0=v_~N~0_64} OutVars{~A~0.base=v_~A~0.base_104, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_41|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_29|, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_59|, #valid=|v_#valid_400|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_27|, #memory_int=|v_#memory_int_275|, #length=|v_#length_353|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_43|, ~N~0=v_~N~0_64, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~short8#1] 25568#[L102-4, L51-12]don't care [1404] L51-12-->L51-16: Formula: (let ((.cse0 (* |v_thread1Thread1of1ForFork2_~i~0#1_43| 4))) (let ((.cse1 (+ .cse0 v_~B~0.offset_74))) (and (<= (+ .cse0 v_~B~0.offset_74 4) (select |v_#length_217| v_~B~0.base_74)) (= |v_thread1Thread1of1ForFork2_#t~mem7#1_13| (select (select |v_#memory_int_191| v_~B~0.base_74) .cse1)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork2_#t~mem7#1_13| v_~maxB~0_23))) (or (and .cse2 |v_thread1Thread1of1ForFork2_#t~short8#1_29|) (and (not .cse2) (not |v_thread1Thread1of1ForFork2_#t~short8#1_29|)))) (= (select |v_#valid_234| v_~B~0.base_74) 1) |v_thread1Thread1of1ForFork2_#t~short8#1_30|))) InVars {~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_30|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} OutVars{~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_13|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_29|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~short8#1] 25576#[L102-4, L51-16]don't care [1557] L51-16-->L50-4: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_62| 4))) (let ((.cse9 (+ v_~A~0.offset_112 .cse2))) (let ((.cse8 (* (select (select |v_#memory_int_291| v_~A~0.base_112) .cse9) 4))) (let ((.cse7 (+ v_~B~0.offset_114 .cse2)) (.cse0 (+ v_~mult~0.offset_85 .cse8))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_150| v_~mult~0.base_85) .cse0)) (.cse4 (* (select (select |v_#memory_int_291| v_~B~0.base_114) .cse7) 4))) (let ((.cse6 (+ .cse3 .cse4)) (.cse1 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) (.cse5 (select (select |v_#memory_$Pointer$.base_150| v_~mult~0.base_85) .cse0))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (<= 0 .cse0) (= (select |v_#valid_426| v_~B~0.base_114) 1) (= v_~res1~0_70 |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) 1 0) 0)) (= (select |v_#valid_426| v_~mult~0.base_85) 1) (= .cse1 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_62| 1) |v_thread1Thread1of1ForFork2_~i~0#1_61|) (not (= (ite |v_thread1Thread1of1ForFork2_#t~short8#1_50| 1 0) 0)) (<= (+ v_~B~0.offset_114 .cse2 4) (select |v_#length_377| v_~B~0.base_114)) (<= (+ .cse3 .cse4 4) (select |v_#length_377| .cse5)) (<= 0 .cse6) (<= (+ v_~A~0.offset_112 .cse2 4) (select |v_#length_377| v_~A~0.base_112)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (= (select (select |v_#memory_int_291| .cse5) .cse6) |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (<= 0 .cse7) (<= (+ v_~mult~0.offset_85 4 .cse8) (select |v_#length_377| v_~mult~0.base_85)) (= (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_11| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= v_~res1~0_69 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (<= 0 .cse9) (= (select |v_#valid_426| v_~A~0.base_112) 1) (= |v_thread1Thread1of1ForFork2_plus_~b#1_11| |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (= (select |v_#valid_426| .cse5) 1) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0))))))))) InVars {~res1~0=v_~res1~0_70, ~A~0.base=v_~A~0.base_112, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_50|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_62|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, #length=|v_#length_377|, ~B~0.offset=v_~B~0.offset_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} OutVars{~res1~0=v_~res1~0_69, ~A~0.base=v_~A~0.base_112, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_11|, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_11|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_29|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_11|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_11|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_17|, #length=|v_#length_377|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_11|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_11|, ~B~0.offset=v_~B~0.offset_114, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_11|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_11|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_45|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_11|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_43|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_33|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_61|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_11|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 25566#[L50-4, L102-4]don't care [2022-07-26 14:15:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1952271230, now seen corresponding path program 1 times [2022-07-26 14:15:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:28,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430121128] [2022-07-26 14:15:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,004 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1552890, now seen corresponding path program 1 times [2022-07-26 14:15:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:29,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661178101] [2022-07-26 14:15:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:29,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661178101] [2022-07-26 14:15:29,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661178101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:29,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:29,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:15:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233849117] [2022-07-26 14:15:29,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:29,040 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-07-26 14:15:29,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:29,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:15:29,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:15:29,040 INFO L87 Difference]: Start difference. First operand 793 states and 2772 transitions. cyclomatic complexity: 2081 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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) [2022-07-26 14:15:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:29,107 INFO L93 Difference]: Finished difference Result 895 states and 3021 transitions. [2022-07-26 14:15:29,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 895 states and 3021 transitions. [2022-07-26 14:15:29,113 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 788 [2022-07-26 14:15:29,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 895 states to 887 states and 2994 transitions. [2022-07-26 14:15:29,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 878 [2022-07-26 14:15:29,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 878 [2022-07-26 14:15:29,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 887 states and 2994 transitions. [2022-07-26 14:15:29,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:29,120 INFO L220 hiAutomatonCegarLoop]: Abstraction has 887 states and 2994 transitions. [2022-07-26 14:15:29,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states and 2994 transitions. [2022-07-26 14:15:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2022-07-26 14:15:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 887 states have (on average 3.375422773393461) internal successors, (2994), 886 states have internal predecessors, (2994), 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) [2022-07-26 14:15:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2994 transitions. [2022-07-26 14:15:29,136 INFO L242 hiAutomatonCegarLoop]: Abstraction has 887 states and 2994 transitions. [2022-07-26 14:15:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:15:29,136 INFO L426 stractBuchiCegarLoop]: Abstraction has 887 states and 2994 transitions. [2022-07-26 14:15:29,137 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-26 14:15:29,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 887 states and 2994 transitions. [2022-07-26 14:15:29,140 INFO L131 ngComponentsAnalysis]: Automaton has 116 accepting balls. 788 [2022-07-26 14:15:29,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:29,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:29,141 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:29,141 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 14:15:29,141 INFO L733 eck$LassoCheckResult]: Stem: 27971#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 27763#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 27767#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 27769#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 28155#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 27885#[L95-6]don't care [1546] L95-6-->L102-3: Formula: (and (= (ite (and (<= 0 v_~M~0_In_3) (< v_~M~0_In_3 v_~N~0_In_5)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (store |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.offset_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))) |v_#memory_$Pointer$.offset_Out_2|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (not (< |v_ULTIMATE.start_main_~i~3#1_In_3| v_~maxA~0_In_3)) (= (store |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#memory_$Pointer$.base_Out_2| (store |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.base_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_In_1|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_In_1|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_Out_2|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 28141#[L102-3]don't care [1196] L102-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork2_thidvar0_2 |v_ULTIMATE.start_main_#t~pre49#1_6|) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_4|, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_4|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_8|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_14|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_8|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_8|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_4|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_8|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_4|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_14|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_14|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_8|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_22|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 28137#[thread1ENTRY, L102-4]don't care [1065] thread1ENTRY-->L50-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] 28127#[L50-4, L102-4]don't care [2022-07-26 14:15:29,142 INFO L735 eck$LassoCheckResult]: Loop: 28127#[L50-4, L102-4]don't care [1207] L50-4-->L51-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_23| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_42))) (and (= (select (select |v_#memory_int_99| v_~A~0.base_42) .cse0) |v_thread1Thread1of1ForFork2_#t~mem2#1_9|) (<= (+ .cse1 v_~A~0.offset_42 4) (select |v_#length_111| v_~A~0.base_42)) (= (select |v_#valid_118| v_~A~0.base_42) 1) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork2_~i~0#1_23| v_~N~0_10)))) InVars {~A~0.base=v_~A~0.base_42, ~A~0.offset=v_~A~0.offset_42, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_99|, #length=|v_#length_111|, ~N~0=v_~N~0_10} OutVars{~A~0.base=v_~A~0.base_42, ~A~0.offset=v_~A~0.offset_42, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_99|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_9|, #length=|v_#length_111|, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2#1] 28131#[L51-1, L102-4]don't care [1488] L51-1-->L51-7: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_55| 4))) (let ((.cse1 (not |v_thread1Thread1of1ForFork2_#t~short4#1_31|)) (.cse3 (+ .cse2 v_~A~0.offset_88))) (and (let ((.cse0 (< |v_thread1Thread1of1ForFork2_#t~mem3#1_15| v_~maxA~0_52))) (or (and (not .cse0) .cse1) (and .cse0 |v_thread1Thread1of1ForFork2_#t~short4#1_31|))) (<= (+ .cse2 v_~A~0.offset_88 4) (select |v_#length_291| v_~A~0.base_88)) (= |v_thread1Thread1of1ForFork2_#t~mem3#1_15| (select (select |v_#memory_int_225| v_~A~0.base_88) .cse3)) (= (select |v_#valid_320| v_~A~0.base_88) 1) (or (and |v_thread1Thread1of1ForFork2_#t~short4#1_31| |v_thread1Thread1of1ForFork2_#t~short6#1_29|) (and .cse1 (not |v_thread1Thread1of1ForFork2_#t~short6#1_29|))) (<= 0 |v_thread1Thread1of1ForFork2_#t~mem2#1_19|) |v_thread1Thread1of1ForFork2_#t~short4#1_32| (<= 0 .cse3)))) InVars {~A~0.base=v_~A~0.base_88, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #valid=|v_#valid_320|, #memory_int=|v_#memory_int_225|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, #length=|v_#length_291|, ~maxA~0=v_~maxA~0_52} OutVars{~A~0.base=v_~A~0.base_88, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_29|, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #valid=|v_#valid_320|, #memory_int=|v_#memory_int_225|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, #length=|v_#length_291|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_31|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_15|, ~maxA~0=v_~maxA~0_52} AuxVars[|v_thread1Thread1of1ForFork2_#t~short4#1_32|] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~mem3#1] 28149#[L51-7, L102-4]don't care [1455] L51-7-->L51-12: Formula: (let ((.cse3 (not |v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|))) (or (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_In_3| 4))) (let ((.cse0 (+ .cse1 v_~B~0.offset_In_5)) (.cse2 (not |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|))) (and |v_thread1Thread1of1ForFork2_#t~short6#1_In_1| (<= 0 .cse0) (= (select |v_#valid_In_5| v_~B~0.base_In_5) 1) (<= (+ .cse1 v_~B~0.offset_In_5 4) (select |v_#length_In_5| v_~B~0.base_In_5)) (or (and |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2| |v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|) (and .cse2 .cse3)) (= (select (select |v_#memory_int_In_5| v_~B~0.base_In_5) .cse0) |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|) (let ((.cse4 (<= 0 |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|))) (or (and .cse2 (not .cse4)) (and |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2| .cse4)))))) (and (not |v_thread1Thread1of1ForFork2_#t~short6#1_In_1|) (= |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2| |v_thread1Thread1of1ForFork2_#t~mem5#1_In_1|) .cse3 (= |v_thread1Thread1of1ForFork2_#t~short6#1_In_1| |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|)))) InVars {thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_In_1|, ~B~0.base=v_~B~0.base_In_5, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ~B~0.offset=v_~B~0.offset_In_5} OutVars{thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|, ~B~0.base=v_~B~0.base_In_5, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|, ~B~0.offset=v_~B~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_#t~short8#1] 28143#[L102-4, L51-12]don't care [1404] L51-12-->L51-16: Formula: (let ((.cse0 (* |v_thread1Thread1of1ForFork2_~i~0#1_43| 4))) (let ((.cse1 (+ .cse0 v_~B~0.offset_74))) (and (<= (+ .cse0 v_~B~0.offset_74 4) (select |v_#length_217| v_~B~0.base_74)) (= |v_thread1Thread1of1ForFork2_#t~mem7#1_13| (select (select |v_#memory_int_191| v_~B~0.base_74) .cse1)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork2_#t~mem7#1_13| v_~maxB~0_23))) (or (and .cse2 |v_thread1Thread1of1ForFork2_#t~short8#1_29|) (and (not .cse2) (not |v_thread1Thread1of1ForFork2_#t~short8#1_29|)))) (= (select |v_#valid_234| v_~B~0.base_74) 1) |v_thread1Thread1of1ForFork2_#t~short8#1_30|))) InVars {~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_30|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} OutVars{~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_13|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_29|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~short8#1] 28133#[L102-4, L51-16]don't care [1557] L51-16-->L50-4: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_62| 4))) (let ((.cse9 (+ v_~A~0.offset_112 .cse2))) (let ((.cse8 (* (select (select |v_#memory_int_291| v_~A~0.base_112) .cse9) 4))) (let ((.cse7 (+ v_~B~0.offset_114 .cse2)) (.cse0 (+ v_~mult~0.offset_85 .cse8))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_150| v_~mult~0.base_85) .cse0)) (.cse4 (* (select (select |v_#memory_int_291| v_~B~0.base_114) .cse7) 4))) (let ((.cse6 (+ .cse3 .cse4)) (.cse1 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) (.cse5 (select (select |v_#memory_$Pointer$.base_150| v_~mult~0.base_85) .cse0))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (<= 0 .cse0) (= (select |v_#valid_426| v_~B~0.base_114) 1) (= v_~res1~0_70 |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) 1 0) 0)) (= (select |v_#valid_426| v_~mult~0.base_85) 1) (= .cse1 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_62| 1) |v_thread1Thread1of1ForFork2_~i~0#1_61|) (not (= (ite |v_thread1Thread1of1ForFork2_#t~short8#1_50| 1 0) 0)) (<= (+ v_~B~0.offset_114 .cse2 4) (select |v_#length_377| v_~B~0.base_114)) (<= (+ .cse3 .cse4 4) (select |v_#length_377| .cse5)) (<= 0 .cse6) (<= (+ v_~A~0.offset_112 .cse2 4) (select |v_#length_377| v_~A~0.base_112)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (= (select (select |v_#memory_int_291| .cse5) .cse6) |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (<= 0 .cse7) (<= (+ v_~mult~0.offset_85 4 .cse8) (select |v_#length_377| v_~mult~0.base_85)) (= (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_11| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= v_~res1~0_69 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (<= 0 .cse9) (= (select |v_#valid_426| v_~A~0.base_112) 1) (= |v_thread1Thread1of1ForFork2_plus_~b#1_11| |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (= (select |v_#valid_426| .cse5) 1) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0))))))))) InVars {~res1~0=v_~res1~0_70, ~A~0.base=v_~A~0.base_112, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_50|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_62|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, #length=|v_#length_377|, ~B~0.offset=v_~B~0.offset_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} OutVars{~res1~0=v_~res1~0_69, ~A~0.base=v_~A~0.base_112, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_11|, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_11|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_29|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_11|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_11|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_17|, #length=|v_#length_377|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_11|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_11|, ~B~0.offset=v_~B~0.offset_114, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_11|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_11|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_45|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_11|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_43|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_33|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_61|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_11|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 28127#[L50-4, L102-4]don't care [2022-07-26 14:15:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1952271230, now seen corresponding path program 2 times [2022-07-26 14:15:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:29,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899222736] [2022-07-26 14:15:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:29,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1189091342, now seen corresponding path program 1 times [2022-07-26 14:15:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917012440] [2022-07-26 14:15:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:29,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,186 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash -714640719, now seen corresponding path program 1 times [2022-07-26 14:15:29,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:29,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143563102] [2022-07-26 14:15:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-26 14:15:29,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:29,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143563102] [2022-07-26 14:15:29,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143563102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:29,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:29,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-26 14:15:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355113786] [2022-07-26 14:15:29,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-26 14:15:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-26 14:15:29,619 INFO L87 Difference]: Start difference. First operand 887 states and 2994 transitions. cyclomatic complexity: 2227 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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) [2022-07-26 14:15:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:29,866 INFO L93 Difference]: Finished difference Result 1713 states and 5449 transitions. [2022-07-26 14:15:29,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1713 states and 5449 transitions. [2022-07-26 14:15:29,876 INFO L131 ngComponentsAnalysis]: Automaton has 236 accepting balls. 1372 [2022-07-26 14:15:29,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1713 states to 1615 states and 5168 transitions. [2022-07-26 14:15:29,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1603 [2022-07-26 14:15:29,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1603 [2022-07-26 14:15:29,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1615 states and 5168 transitions. [2022-07-26 14:15:29,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:29,889 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1615 states and 5168 transitions. [2022-07-26 14:15:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states and 5168 transitions. [2022-07-26 14:15:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1336. [2022-07-26 14:15:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1336 states have (on average 3.3675149700598803) internal successors, (4499), 1335 states have internal predecessors, (4499), 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) [2022-07-26 14:15:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 4499 transitions. [2022-07-26 14:15:29,911 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1336 states and 4499 transitions. [2022-07-26 14:15:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-26 14:15:29,912 INFO L426 stractBuchiCegarLoop]: Abstraction has 1336 states and 4499 transitions. [2022-07-26 14:15:29,912 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-26 14:15:29,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1336 states and 4499 transitions. [2022-07-26 14:15:29,919 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 1148 [2022-07-26 14:15:29,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:29,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:29,919 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:29,919 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 14:15:29,920 INFO L733 eck$LassoCheckResult]: Stem: 31704#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 31340#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 31342#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 31308#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 31160#[L120-22]don't care [1478] L120-22-->L120-22: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|))) (and (= (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.offset_102|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79| 4) (select |v_#length_273| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|)) (= (select |v_#valid_302| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) 1) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.base_102|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|) (<= 0 .cse0) (= |v_#memory_int_215| (store |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|)))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_103|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_216|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_103|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_102|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_55|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_215|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_102|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 31162#[L120-22]don't care [1544] L120-22-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~3#1_51| 4))) (let ((.cse0 (+ v_~mult~0.offset_79 .cse1))) (and (= (store |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|)) |v_#memory_$Pointer$.offset_146|) (<= 0 .cse0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_154|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|) (= (store |v_#memory_int_284| v_~mult~0.base_79 (store (select |v_#memory_int_284| v_~mult~0.base_79) .cse0 (select (select |v_#memory_int_283| v_~mult~0.base_79) .cse0))) |v_#memory_int_283|) (<= (+ v_~mult~0.offset_79 4 .cse1) (select |v_#length_361| v_~mult~0.base_79)) (= (select |v_#valid_408| v_~mult~0.base_79) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|) (= |v_ULTIMATE.start_main_~i~3#1_50| (+ |v_ULTIMATE.start_main_~i~3#1_51| 1)) (= (store |v_#memory_$Pointer$.base_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.base_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|)) |v_#memory_$Pointer$.base_146|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_147|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.base=v_~mult~0.base_79, ~mult~0.offset=v_~mult~0.offset_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_284|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_147|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_51|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_27|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_146|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.offset=v_~mult~0.offset_79, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_27|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_25|, ~mult~0.base=v_~mult~0.base_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_283|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_146|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_50|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret48#1.base, #memory_$Pointer$.base, ULTIMATE.start_main_#t~ret48#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~i~3#1] 32032#[L95-6]don't care [1546] L95-6-->L102-3: Formula: (and (= (ite (and (<= 0 v_~M~0_In_3) (< v_~M~0_In_3 v_~N~0_In_5)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (store |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.offset_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))) |v_#memory_$Pointer$.offset_Out_2|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (not (< |v_ULTIMATE.start_main_~i~3#1_In_3| v_~maxA~0_In_3)) (= (store |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#memory_$Pointer$.base_Out_2| (store |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.base_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_In_1|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_In_1|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_Out_2|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 32030#[L102-3]don't care [1196] L102-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork2_thidvar0_2 |v_ULTIMATE.start_main_#t~pre49#1_6|) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_4|, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_4|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_8|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_14|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_8|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_8|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_4|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_8|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_4|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_14|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_14|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_8|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_22|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 32028#[thread1ENTRY, L102-4]don't care [1065] thread1ENTRY-->L50-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] 30550#[L50-4, L102-4]don't care [2022-07-26 14:15:29,920 INFO L735 eck$LassoCheckResult]: Loop: 30550#[L50-4, L102-4]don't care [1207] L50-4-->L51-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_23| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_42))) (and (= (select (select |v_#memory_int_99| v_~A~0.base_42) .cse0) |v_thread1Thread1of1ForFork2_#t~mem2#1_9|) (<= (+ .cse1 v_~A~0.offset_42 4) (select |v_#length_111| v_~A~0.base_42)) (= (select |v_#valid_118| v_~A~0.base_42) 1) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork2_~i~0#1_23| v_~N~0_10)))) InVars {~A~0.base=v_~A~0.base_42, ~A~0.offset=v_~A~0.offset_42, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_99|, #length=|v_#length_111|, ~N~0=v_~N~0_10} OutVars{~A~0.base=v_~A~0.base_42, ~A~0.offset=v_~A~0.offset_42, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_99|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_9|, #length=|v_#length_111|, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2#1] 30558#[L51-1, L102-4]don't care [1488] L51-1-->L51-7: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_55| 4))) (let ((.cse1 (not |v_thread1Thread1of1ForFork2_#t~short4#1_31|)) (.cse3 (+ .cse2 v_~A~0.offset_88))) (and (let ((.cse0 (< |v_thread1Thread1of1ForFork2_#t~mem3#1_15| v_~maxA~0_52))) (or (and (not .cse0) .cse1) (and .cse0 |v_thread1Thread1of1ForFork2_#t~short4#1_31|))) (<= (+ .cse2 v_~A~0.offset_88 4) (select |v_#length_291| v_~A~0.base_88)) (= |v_thread1Thread1of1ForFork2_#t~mem3#1_15| (select (select |v_#memory_int_225| v_~A~0.base_88) .cse3)) (= (select |v_#valid_320| v_~A~0.base_88) 1) (or (and |v_thread1Thread1of1ForFork2_#t~short4#1_31| |v_thread1Thread1of1ForFork2_#t~short6#1_29|) (and .cse1 (not |v_thread1Thread1of1ForFork2_#t~short6#1_29|))) (<= 0 |v_thread1Thread1of1ForFork2_#t~mem2#1_19|) |v_thread1Thread1of1ForFork2_#t~short4#1_32| (<= 0 .cse3)))) InVars {~A~0.base=v_~A~0.base_88, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #valid=|v_#valid_320|, #memory_int=|v_#memory_int_225|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, #length=|v_#length_291|, ~maxA~0=v_~maxA~0_52} OutVars{~A~0.base=v_~A~0.base_88, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_29|, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #valid=|v_#valid_320|, #memory_int=|v_#memory_int_225|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, #length=|v_#length_291|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_31|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_15|, ~maxA~0=v_~maxA~0_52} AuxVars[|v_thread1Thread1of1ForFork2_#t~short4#1_32|] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~mem3#1] 32640#[L51-7, L102-4]don't care [1455] L51-7-->L51-12: Formula: (let ((.cse3 (not |v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|))) (or (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_In_3| 4))) (let ((.cse0 (+ .cse1 v_~B~0.offset_In_5)) (.cse2 (not |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|))) (and |v_thread1Thread1of1ForFork2_#t~short6#1_In_1| (<= 0 .cse0) (= (select |v_#valid_In_5| v_~B~0.base_In_5) 1) (<= (+ .cse1 v_~B~0.offset_In_5 4) (select |v_#length_In_5| v_~B~0.base_In_5)) (or (and |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2| |v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|) (and .cse2 .cse3)) (= (select (select |v_#memory_int_In_5| v_~B~0.base_In_5) .cse0) |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|) (let ((.cse4 (<= 0 |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|))) (or (and .cse2 (not .cse4)) (and |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2| .cse4)))))) (and (not |v_thread1Thread1of1ForFork2_#t~short6#1_In_1|) (= |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2| |v_thread1Thread1of1ForFork2_#t~mem5#1_In_1|) .cse3 (= |v_thread1Thread1of1ForFork2_#t~short6#1_In_1| |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|)))) InVars {thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_In_1|, ~B~0.base=v_~B~0.base_In_5, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ~B~0.offset=v_~B~0.offset_In_5} OutVars{thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|, ~B~0.base=v_~B~0.base_In_5, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|, ~B~0.offset=v_~B~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_#t~short8#1] 33032#[L102-4, L51-12]don't care [1404] L51-12-->L51-16: Formula: (let ((.cse0 (* |v_thread1Thread1of1ForFork2_~i~0#1_43| 4))) (let ((.cse1 (+ .cse0 v_~B~0.offset_74))) (and (<= (+ .cse0 v_~B~0.offset_74 4) (select |v_#length_217| v_~B~0.base_74)) (= |v_thread1Thread1of1ForFork2_#t~mem7#1_13| (select (select |v_#memory_int_191| v_~B~0.base_74) .cse1)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork2_#t~mem7#1_13| v_~maxB~0_23))) (or (and .cse2 |v_thread1Thread1of1ForFork2_#t~short8#1_29|) (and (not .cse2) (not |v_thread1Thread1of1ForFork2_#t~short8#1_29|)))) (= (select |v_#valid_234| v_~B~0.base_74) 1) |v_thread1Thread1of1ForFork2_#t~short8#1_30|))) InVars {~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_30|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} OutVars{~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_13|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_29|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~short8#1] 33028#[L102-4, L51-16]don't care [1557] L51-16-->L50-4: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_62| 4))) (let ((.cse9 (+ v_~A~0.offset_112 .cse2))) (let ((.cse8 (* (select (select |v_#memory_int_291| v_~A~0.base_112) .cse9) 4))) (let ((.cse7 (+ v_~B~0.offset_114 .cse2)) (.cse0 (+ v_~mult~0.offset_85 .cse8))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_150| v_~mult~0.base_85) .cse0)) (.cse4 (* (select (select |v_#memory_int_291| v_~B~0.base_114) .cse7) 4))) (let ((.cse6 (+ .cse3 .cse4)) (.cse1 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) (.cse5 (select (select |v_#memory_$Pointer$.base_150| v_~mult~0.base_85) .cse0))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (<= 0 .cse0) (= (select |v_#valid_426| v_~B~0.base_114) 1) (= v_~res1~0_70 |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) 1 0) 0)) (= (select |v_#valid_426| v_~mult~0.base_85) 1) (= .cse1 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_62| 1) |v_thread1Thread1of1ForFork2_~i~0#1_61|) (not (= (ite |v_thread1Thread1of1ForFork2_#t~short8#1_50| 1 0) 0)) (<= (+ v_~B~0.offset_114 .cse2 4) (select |v_#length_377| v_~B~0.base_114)) (<= (+ .cse3 .cse4 4) (select |v_#length_377| .cse5)) (<= 0 .cse6) (<= (+ v_~A~0.offset_112 .cse2 4) (select |v_#length_377| v_~A~0.base_112)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (= (select (select |v_#memory_int_291| .cse5) .cse6) |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (<= 0 .cse7) (<= (+ v_~mult~0.offset_85 4 .cse8) (select |v_#length_377| v_~mult~0.base_85)) (= (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_11| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= v_~res1~0_69 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (<= 0 .cse9) (= (select |v_#valid_426| v_~A~0.base_112) 1) (= |v_thread1Thread1of1ForFork2_plus_~b#1_11| |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (= (select |v_#valid_426| .cse5) 1) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0))))))))) InVars {~res1~0=v_~res1~0_70, ~A~0.base=v_~A~0.base_112, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_50|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_62|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, #length=|v_#length_377|, ~B~0.offset=v_~B~0.offset_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} OutVars{~res1~0=v_~res1~0_69, ~A~0.base=v_~A~0.base_112, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_11|, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_11|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_29|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_11|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_11|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_17|, #length=|v_#length_377|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_11|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_11|, ~B~0.offset=v_~B~0.offset_114, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_11|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_11|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_45|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_11|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_43|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_33|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_61|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_11|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 30550#[L50-4, L102-4]don't care [2022-07-26 14:15:29,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash -256495415, now seen corresponding path program 1 times [2022-07-26 14:15:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:29,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381582724] [2022-07-26 14:15:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-26 14:15:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:29,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381582724] [2022-07-26 14:15:29,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381582724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:29,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:29,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:15:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356072186] [2022-07-26 14:15:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:29,962 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:15:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1189091342, now seen corresponding path program 2 times [2022-07-26 14:15:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:29,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069999446] [2022-07-26 14:15:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:30,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:15:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:15:30,360 INFO L87 Difference]: Start difference. First operand 1336 states and 4499 transitions. cyclomatic complexity: 3355 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-26 14:15:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:30,433 INFO L93 Difference]: Finished difference Result 1341 states and 4506 transitions. [2022-07-26 14:15:30,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1341 states and 4506 transitions. [2022-07-26 14:15:30,440 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 1148 [2022-07-26 14:15:30,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1341 states to 1333 states and 4493 transitions. [2022-07-26 14:15:30,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1324 [2022-07-26 14:15:30,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1324 [2022-07-26 14:15:30,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1333 states and 4493 transitions. [2022-07-26 14:15:30,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:30,452 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1333 states and 4493 transitions. [2022-07-26 14:15:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states and 4493 transitions. [2022-07-26 14:15:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2022-07-26 14:15:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1333 states have (on average 3.3705926481620403) internal successors, (4493), 1332 states have internal predecessors, (4493), 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) [2022-07-26 14:15:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 4493 transitions. [2022-07-26 14:15:30,474 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1333 states and 4493 transitions. [2022-07-26 14:15:30,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:15:30,474 INFO L426 stractBuchiCegarLoop]: Abstraction has 1333 states and 4493 transitions. [2022-07-26 14:15:30,474 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-26 14:15:30,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1333 states and 4493 transitions. [2022-07-26 14:15:30,479 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 1148 [2022-07-26 14:15:30,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:30,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:30,479 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:30,479 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:15:30,480 INFO L733 eck$LassoCheckResult]: Stem: 35780#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 35372#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 35374#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 36280#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 36270#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 35548#[L95-6]don't care [1546] L95-6-->L102-3: Formula: (and (= (ite (and (<= 0 v_~M~0_In_3) (< v_~M~0_In_3 v_~N~0_In_5)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (store |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.offset_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))) |v_#memory_$Pointer$.offset_Out_2|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (not (< |v_ULTIMATE.start_main_~i~3#1_In_3| v_~maxA~0_In_3)) (= (store |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#memory_$Pointer$.base_Out_2| (store |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.base_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_In_1|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_In_1|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_Out_2|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 36250#[L102-3]don't care [1196] L102-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork2_thidvar0_2 |v_ULTIMATE.start_main_#t~pre49#1_6|) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_4|, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_4|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_8|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_14|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_8|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_8|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_4|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_8|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_4|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_14|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_14|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_8|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_22|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 36248#[thread1ENTRY, L102-4]don't care [1493] L102-4-->L103-3: Formula: (and (= (select |v_#valid_328| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_299| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_$Pointer$.base_111| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_$Pointer$.base_111| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|))) |v_#memory_$Pointer$.base_110|) (= |v_#pthreadsForks_37| |v_ULTIMATE.start_main_#t~pre51#1_21|) (= |v_#memory_$Pointer$.offset_110| (store |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|)))) (= |v_#memory_int_231| (store |v_#memory_int_232| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_232| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre51#1_21|)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_111|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_328|, #memory_int=|v_#memory_int_232|, #length=|v_#length_299|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_111|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_110|, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_21|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_328|, #memory_int=|v_#memory_int_231|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_13|, #length=|v_#length_299|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, ULTIMATE.start_main_#t~pre51#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet50#1, #memory_$Pointer$.offset] 36242#[thread1ENTRY, L103-3]don't care [1190] L103-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre51#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_6|} OutVars{ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_4|, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_14|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem24#1.base=|v_thread2Thread1of1ForFork0_#t~mem24#1.base_4|, thread2Thread1of1ForFork0_#t~mem22#1=|v_thread2Thread1of1ForFork0_#t~mem22#1_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_22|, thread2Thread1of1ForFork0_#t~short17#1=|v_thread2Thread1of1ForFork0_#t~short17#1_14|, thread2Thread1of1ForFork0_#t~mem18#1=|v_thread2Thread1of1ForFork0_#t~mem18#1_8|, thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_14|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_4|, thread2Thread1of1ForFork0_#t~mem20#1=|v_thread2Thread1of1ForFork0_#t~mem20#1_8|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_4|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_4|, thread2Thread1of1ForFork0_#t~mem23#1=|v_thread2Thread1of1ForFork0_#t~mem23#1_4|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_8|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_4|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_8|, thread2Thread1of1ForFork0_#t~mem25#1=|v_thread2Thread1of1ForFork0_#t~mem25#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~ret26#1=|v_thread2Thread1of1ForFork0_#t~ret26#1_4|, thread2Thread1of1ForFork0_#t~post14#1=|v_thread2Thread1of1ForFork0_#t~post14#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem24#1.offset=|v_thread2Thread1of1ForFork0_#t~mem24#1.offset_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~short21#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem24#1.base, thread2Thread1of1ForFork0_#t~mem22#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~short17#1, thread2Thread1of1ForFork0_#t~mem18#1, thread2Thread1of1ForFork0_#t~short19#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#t~mem20#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_#t~mem23#1, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem15#1, thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_#t~mem25#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~ret26#1, thread2Thread1of1ForFork0_#t~post14#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem24#1.offset] 36240#[thread2ENTRY, L103-4, thread1ENTRY]don't care [1106] thread2ENTRY-->L61-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 34436#[L103-4, L61-4, thread1ENTRY]don't care [2022-07-26 14:15:30,480 INFO L735 eck$LassoCheckResult]: Loop: 34436#[L103-4, L61-4, thread1ENTRY]don't care [1477] L61-4-->L62-7: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_53| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_86))) (and (= |v_thread2Thread1of1ForFork0_#t~mem15#1_19| (select (select |v_#memory_int_213| v_~A~0.base_86) .cse0)) (not |v_thread2Thread1of1ForFork0_#t~short17#1_31|) (not (<= 0 |v_thread2Thread1of1ForFork0_#t~mem15#1_19|)) (not |v_thread2Thread1of1ForFork0_#t~short19#1_33|) (<= (+ .cse1 v_~A~0.offset_86 4) (select |v_#length_271| v_~A~0.base_86)) (< |v_thread2Thread1of1ForFork0_~i~1#1_53| v_~M~0_27) (= (select |v_#valid_300| v_~A~0.base_86) 1) (<= 0 .cse0)))) InVars {~A~0.base=v_~A~0.base_86, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_27, #valid=|v_#valid_300|, #memory_int=|v_#memory_int_213|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, #length=|v_#length_271|} OutVars{~A~0.base=v_~A~0.base_86, thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_33|, ~A~0.offset=v_~A~0.offset_86, ~M~0=v_~M~0_27, #valid=|v_#valid_300|, #memory_int=|v_#memory_int_213|, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_19|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_53|, #length=|v_#length_271|, thread2Thread1of1ForFork0_#t~short17#1=|v_thread2Thread1of1ForFork0_#t~short17#1_31|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~short19#1, thread2Thread1of1ForFork0_#t~mem15#1, thread2Thread1of1ForFork0_#t~short17#1] 34438#[L103-4, L62-7, thread1ENTRY]don't care [1453] L62-7-->L62-12: Formula: (let ((.cse0 (not |v_thread2Thread1of1ForFork0_#t~short21#1_Out_2|))) (or (and .cse0 (not |v_thread2Thread1of1ForFork0_#t~short19#1_In_1|) (= |v_thread2Thread1of1ForFork0_#t~short19#1_In_1| |v_thread2Thread1of1ForFork0_#t~short19#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem18#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem18#1_Out_2|)) (let ((.cse4 (* |v_thread2Thread1of1ForFork0_~i~1#1_In_3| 4))) (let ((.cse1 (+ .cse4 v_~B~0.offset_In_1)) (.cse2 (not |v_thread2Thread1of1ForFork0_#t~short19#1_Out_2|))) (and (= (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) .cse1) |v_thread2Thread1of1ForFork0_#t~mem18#1_Out_2|) |v_thread2Thread1of1ForFork0_#t~short19#1_In_1| (<= 0 .cse1) (or (and |v_thread2Thread1of1ForFork0_#t~short19#1_Out_2| |v_thread2Thread1of1ForFork0_#t~short21#1_Out_2|) (and .cse0 .cse2)) (let ((.cse3 (<= 0 |v_thread2Thread1of1ForFork0_#t~mem18#1_Out_2|))) (or (and |v_thread2Thread1of1ForFork0_#t~short19#1_Out_2| .cse3) (and (not .cse3) .cse2))) (= (select |v_#valid_In_1| v_~B~0.base_In_1) 1) (<= (+ .cse4 v_~B~0.offset_In_1 4) (select |v_#length_In_1| v_~B~0.base_In_1))))))) InVars {thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_In_1|, ~B~0.base=v_~B~0.base_In_1, #valid=|v_#valid_In_1|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, #length=|v_#length_In_1|, ~B~0.offset=v_~B~0.offset_In_1, thread2Thread1of1ForFork0_#t~mem18#1=|v_thread2Thread1of1ForFork0_#t~mem18#1_In_1|} OutVars{thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_Out_2|, ~B~0.base=v_~B~0.base_In_1, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_Out_2|, #valid=|v_#valid_In_1|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, #length=|v_#length_In_1|, ~B~0.offset=v_~B~0.offset_In_1, thread2Thread1of1ForFork0_#t~mem18#1=|v_thread2Thread1of1ForFork0_#t~mem18#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~short19#1, thread2Thread1of1ForFork0_#t~short21#1, thread2Thread1of1ForFork0_#t~mem18#1] 35518#[L103-4, L62-12, thread1ENTRY]don't care [1549] L62-12-->L62-18: Formula: (or (let ((.cse2 (* |v_thread2Thread1of1ForFork0_~i~1#1_In_5| 4))) (let ((.cse0 (+ .cse2 v_~B~0.offset_In_9))) (and (= (ite |v_thread2Thread1of1ForFork0_#t~short21#1_Out_6| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem20#1_Out_2| (select (select |v_#memory_int_In_11| v_~B~0.base_In_9) .cse0)) (<= 0 .cse0) (let ((.cse1 (< |v_thread2Thread1of1ForFork0_#t~mem20#1_Out_2| v_~maxB~0_In_3))) (or (and .cse1 |v_thread2Thread1of1ForFork0_#t~short21#1_Out_6|) (and (not .cse1) (not |v_thread2Thread1of1ForFork0_#t~short21#1_Out_6|)))) (= (select |v_#valid_In_17| v_~B~0.base_In_9) 1) |v_thread2Thread1of1ForFork0_#t~short21#1_In_1| (<= (+ .cse2 v_~B~0.offset_In_9 4) (select |v_#length_In_17| v_~B~0.base_In_9))))) (and (= |v_thread2Thread1of1ForFork0_#t~mem20#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem20#1_In_1|) (= (ite |v_thread2Thread1of1ForFork0_#t~short21#1_In_1| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~short21#1_In_1| |v_thread2Thread1of1ForFork0_#t~short21#1_Out_6|) (not |v_thread2Thread1of1ForFork0_#t~short21#1_In_1|))) InVars {~B~0.base=v_~B~0.base_In_9, thread2Thread1of1ForFork0_#t~mem20#1=|v_thread2Thread1of1ForFork0_#t~mem20#1_In_1|, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_In_1|, #valid=|v_#valid_In_17|, #memory_int=|v_#memory_int_In_11|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_5|, #length=|v_#length_In_17|, ~B~0.offset=v_~B~0.offset_In_9, ~maxB~0=v_~maxB~0_In_3} OutVars{thread2Thread1of1ForFork0_#t~mem20#1=|v_thread2Thread1of1ForFork0_#t~mem20#1_Out_2|, ~B~0.base=v_~B~0.base_In_9, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_Out_6|, #valid=|v_#valid_In_17|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_11|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_5|, #length=|v_#length_In_17|, ~B~0.offset=v_~B~0.offset_In_9, ~maxB~0=v_~maxB~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem20#1, thread2Thread1of1ForFork0_#t~short21#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] 34724#[L103-4, L62-18, thread1ENTRY]don't care [1569] L62-18-->L61-4: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_68| 4))) (let ((.cse7 (+ v_~A~0.offset_124 .cse1))) (let ((.cse4 (* (select (select |v_#memory_int_303| v_~A~0.base_124) .cse7) 4))) (let ((.cse2 (+ v_~B~0.offset_128 .cse1)) (.cse0 (+ v_~mult~0.offset_93 .cse4))) (let ((.cse8 (select (select |v_#memory_$Pointer$.offset_158| v_~mult~0.base_93) .cse0)) (.cse9 (* (select (select |v_#memory_int_303| v_~B~0.base_128) .cse2) 4))) (let ((.cse3 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_15| |v_thread2Thread1of1ForFork0_plus_~b#1_15|)) (.cse5 (select (select |v_#memory_$Pointer$.base_158| v_~mult~0.base_93) .cse0)) (.cse6 (+ .cse8 .cse9))) (and (<= 0 .cse0) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_15| v_~res2~0_130) (<= (+ v_~B~0.offset_128 .cse1 4) (select |v_#length_401| v_~B~0.base_128)) (<= 0 .cse2) (= (ite (or (<= .cse3 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_15| 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= |v_thread2Thread1of1ForFork0_~i~1#1_67| (+ |v_thread2Thread1of1ForFork0_~i~1#1_68| 1)) (= |v_thread2Thread1of1ForFork0_plus_#res#1_15| .cse3) (= |v_thread2Thread1of1ForFork0_plus_#res#1_15| v_~res2~0_129) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38| 0)) (<= (+ v_~mult~0.offset_93 4 .cse4) (select |v_#length_401| v_~mult~0.base_93)) (= (select |v_#valid_454| .cse5) 1) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_15| (select (select |v_#memory_int_303| .cse5) .cse6)) (<= 0 .cse7) (= (select |v_#valid_454| v_~B~0.base_128) 1) (= (select |v_#valid_454| v_~A~0.base_124) 1) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_15| |v_thread2Thread1of1ForFork0_plus_~b#1_15| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_15|)) 1 0) 0)) (= (select |v_#valid_454| v_~mult~0.base_93) 1) (<= (+ .cse8 .cse9 4) (select |v_#length_401| .cse5)) (<= 0 .cse6) (= |v_thread2Thread1of1ForFork0_plus_~a#1_15| |v_thread2Thread1of1ForFork0_plus_#in~a#1_15|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= |v_thread2Thread1of1ForFork0_plus_~b#1_15| |v_thread2Thread1of1ForFork0_plus_#in~b#1_15|) (<= (+ v_~A~0.offset_124 .cse1 4) (select |v_#length_401| v_~A~0.base_124))))))))) InVars {~A~0.base=v_~A~0.base_124, ~B~0.base=v_~B~0.base_128, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_158|, ~mult~0.offset=v_~mult~0.offset_93, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_68|, ~A~0.offset=v_~A~0.offset_124, #valid=|v_#valid_454|, ~mult~0.base=v_~mult~0.base_93, #memory_int=|v_#memory_int_303|, #length=|v_#length_401|, ~B~0.offset=v_~B~0.offset_128, ~res2~0=v_~res2~0_130, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_158|} OutVars{~A~0.base=v_~A~0.base_124, ~B~0.base=v_~B~0.base_128, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_158|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_15|, ~mult~0.offset=v_~mult~0.offset_93, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_49|, thread2Thread1of1ForFork0_#t~mem24#1.base=|v_thread2Thread1of1ForFork0_#t~mem24#1.base_15|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread2Thread1of1ForFork0_#t~mem22#1=|v_thread2Thread1of1ForFork0_#t~mem22#1_15|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_67|, thread2Thread1of1ForFork0_#t~short17#1=|v_thread2Thread1of1ForFork0_#t~short17#1_39|, thread2Thread1of1ForFork0_#t~mem18#1=|v_thread2Thread1of1ForFork0_#t~mem18#1_25|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_15|, thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_41|, thread2Thread1of1ForFork0_#t~mem20#1=|v_thread2Thread1of1ForFork0_#t~mem20#1_31|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_15|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_15|, thread2Thread1of1ForFork0_#t~mem23#1=|v_thread2Thread1of1ForFork0_#t~mem23#1_15|, #length=|v_#length_401|, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_27|, ~B~0.offset=v_~B~0.offset_128, ~res2~0=v_~res2~0_129, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_15|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_23|, thread2Thread1of1ForFork0_#t~mem25#1=|v_thread2Thread1of1ForFork0_#t~mem25#1_15|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_43|, thread2Thread1of1ForFork0_#t~ret26#1=|v_thread2Thread1of1ForFork0_#t~ret26#1_15|, ~A~0.offset=v_~A~0.offset_124, thread2Thread1of1ForFork0_#t~post14#1=|v_thread2Thread1of1ForFork0_#t~post14#1_25|, #valid=|v_#valid_454|, ~mult~0.base=v_~mult~0.base_93, #memory_int=|v_#memory_int_303|, thread2Thread1of1ForFork0_#t~mem24#1.offset=|v_thread2Thread1of1ForFork0_#t~mem24#1.offset_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_158|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~short21#1, thread2Thread1of1ForFork0_#t~mem24#1.base, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem22#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~short17#1, thread2Thread1of1ForFork0_#t~mem18#1, thread2Thread1of1ForFork0_#t~mem25#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#t~short19#1, thread2Thread1of1ForFork0_#t~mem20#1, thread2Thread1of1ForFork0_#t~ret26#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_#t~mem23#1, thread2Thread1of1ForFork0_#t~post14#1, thread2Thread1of1ForFork0_#t~mem15#1, ~res2~0, thread2Thread1of1ForFork0_#t~mem24#1.offset] 34436#[L103-4, L61-4, thread1ENTRY]don't care [2022-07-26 14:15:30,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash -767607018, now seen corresponding path program 1 times [2022-07-26 14:15:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323033019] [2022-07-26 14:15:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash 46370749, now seen corresponding path program 1 times [2022-07-26 14:15:30,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193503734] [2022-07-26 14:15:30,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:30,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:30,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193503734] [2022-07-26 14:15:30,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193503734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:30,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:30,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:15:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846885302] [2022-07-26 14:15:30,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:30,535 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-07-26 14:15:30,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:30,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:15:30,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:15:30,535 INFO L87 Difference]: Start difference. First operand 1333 states and 4493 transitions. cyclomatic complexity: 3352 Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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) [2022-07-26 14:15:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:30,675 INFO L93 Difference]: Finished difference Result 1915 states and 6216 transitions. [2022-07-26 14:15:30,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1915 states and 6216 transitions. [2022-07-26 14:15:30,685 INFO L131 ngComponentsAnalysis]: Automaton has 254 accepting balls. 1382 [2022-07-26 14:15:30,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1915 states to 1633 states and 5301 transitions. [2022-07-26 14:15:30,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1624 [2022-07-26 14:15:30,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1624 [2022-07-26 14:15:30,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1633 states and 5301 transitions. [2022-07-26 14:15:30,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:30,698 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1633 states and 5301 transitions. [2022-07-26 14:15:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states and 5301 transitions. [2022-07-26 14:15:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2022-07-26 14:15:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1633 states have (on average 3.2461726883037354) internal successors, (5301), 1632 states have internal predecessors, (5301), 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) [2022-07-26 14:15:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 5301 transitions. [2022-07-26 14:15:30,723 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1633 states and 5301 transitions. [2022-07-26 14:15:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:15:30,724 INFO L426 stractBuchiCegarLoop]: Abstraction has 1633 states and 5301 transitions. [2022-07-26 14:15:30,724 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-26 14:15:30,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1633 states and 5301 transitions. [2022-07-26 14:15:30,729 INFO L131 ngComponentsAnalysis]: Automaton has 254 accepting balls. 1382 [2022-07-26 14:15:30,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:30,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:30,729 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:30,729 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 14:15:30,730 INFO L733 eck$LassoCheckResult]: Stem: 40303#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 39913#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 39915#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 39917#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 40087#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 39869#[L95-6]don't care [1546] L95-6-->L102-3: Formula: (and (= (ite (and (<= 0 v_~M~0_In_3) (< v_~M~0_In_3 v_~N~0_In_5)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (store |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.offset_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))) |v_#memory_$Pointer$.offset_Out_2|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (not (< |v_ULTIMATE.start_main_~i~3#1_In_3| v_~maxA~0_In_3)) (= (store |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#memory_$Pointer$.base_Out_2| (store |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.base_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_In_1|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_In_1|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_Out_2|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 39289#[L102-3]don't care [1196] L102-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork2_thidvar0_2 |v_ULTIMATE.start_main_#t~pre49#1_6|) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_4|, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_4|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_8|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_14|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_8|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_8|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_4|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_8|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_4|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_14|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_14|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_8|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_22|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 39291#[thread1ENTRY, L102-4]don't care [1493] L102-4-->L103-3: Formula: (and (= (select |v_#valid_328| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_299| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_$Pointer$.base_111| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_$Pointer$.base_111| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|))) |v_#memory_$Pointer$.base_110|) (= |v_#pthreadsForks_37| |v_ULTIMATE.start_main_#t~pre51#1_21|) (= |v_#memory_$Pointer$.offset_110| (store |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|)))) (= |v_#memory_int_231| (store |v_#memory_int_232| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_232| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre51#1_21|)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_111|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_328|, #memory_int=|v_#memory_int_232|, #length=|v_#length_299|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_111|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_110|, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_21|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_328|, #memory_int=|v_#memory_int_231|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_13|, #length=|v_#length_299|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, ULTIMATE.start_main_#t~pre51#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet50#1, #memory_$Pointer$.offset] 39065#[thread1ENTRY, L103-3]don't care [1190] L103-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre51#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_6|} OutVars{ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_4|, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_14|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem24#1.base=|v_thread2Thread1of1ForFork0_#t~mem24#1.base_4|, thread2Thread1of1ForFork0_#t~mem22#1=|v_thread2Thread1of1ForFork0_#t~mem22#1_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_22|, thread2Thread1of1ForFork0_#t~short17#1=|v_thread2Thread1of1ForFork0_#t~short17#1_14|, thread2Thread1of1ForFork0_#t~mem18#1=|v_thread2Thread1of1ForFork0_#t~mem18#1_8|, thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_14|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_4|, thread2Thread1of1ForFork0_#t~mem20#1=|v_thread2Thread1of1ForFork0_#t~mem20#1_8|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_4|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_4|, thread2Thread1of1ForFork0_#t~mem23#1=|v_thread2Thread1of1ForFork0_#t~mem23#1_4|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_8|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_4|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_8|, thread2Thread1of1ForFork0_#t~mem25#1=|v_thread2Thread1of1ForFork0_#t~mem25#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_12|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~ret26#1=|v_thread2Thread1of1ForFork0_#t~ret26#1_4|, thread2Thread1of1ForFork0_#t~post14#1=|v_thread2Thread1of1ForFork0_#t~post14#1_8|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem24#1.offset=|v_thread2Thread1of1ForFork0_#t~mem24#1.offset_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~short21#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem24#1.base, thread2Thread1of1ForFork0_#t~mem22#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~short17#1, thread2Thread1of1ForFork0_#t~mem18#1, thread2Thread1of1ForFork0_#t~short19#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#t~mem20#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_#t~mem23#1, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem15#1, thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_#t~mem25#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~ret26#1, thread2Thread1of1ForFork0_#t~post14#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem24#1.offset] 39067#[thread2ENTRY, L103-4, thread1ENTRY]don't care [1106] thread2ENTRY-->L61-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 39027#[L103-4, L61-4, thread1ENTRY]don't care [2022-07-26 14:15:30,730 INFO L735 eck$LassoCheckResult]: Loop: 39027#[L103-4, L61-4, thread1ENTRY]don't care [1384] L61-4-->L62-3: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_37| 4))) (let ((.cse0 (+ v_~A~0.offset_62 .cse1))) (and (= (select (select |v_#memory_int_177| v_~A~0.base_62) .cse0) |v_thread2Thread1of1ForFork0_#t~mem15#1_13|) |v_thread2Thread1of1ForFork0_#t~short17#1_23| (< |v_thread2Thread1of1ForFork0_~i~1#1_37| v_~M~0_19) (<= 0 .cse0) (<= 0 |v_thread2Thread1of1ForFork0_#t~mem15#1_13|) (<= (+ v_~A~0.offset_62 4 .cse1) (select |v_#length_205| v_~A~0.base_62)) (= (select |v_#valid_222| v_~A~0.base_62) 1)))) InVars {~A~0.base=v_~A~0.base_62, ~A~0.offset=v_~A~0.offset_62, ~M~0=v_~M~0_19, #valid=|v_#valid_222|, #memory_int=|v_#memory_int_177|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_37|, #length=|v_#length_205|} OutVars{~A~0.base=v_~A~0.base_62, ~A~0.offset=v_~A~0.offset_62, ~M~0=v_~M~0_19, #valid=|v_#valid_222|, #memory_int=|v_#memory_int_177|, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_13|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_37|, #length=|v_#length_205|, thread2Thread1of1ForFork0_#t~short17#1=|v_thread2Thread1of1ForFork0_#t~short17#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem15#1, thread2Thread1of1ForFork0_#t~short17#1] 39029#[L103-4, L62-3, thread1ENTRY]don't care [1440] L62-3-->L62-7: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_49| 4))) (let ((.cse2 (not |v_thread2Thread1of1ForFork0_#t~short17#1_29|)) (.cse3 (+ .cse0 v_~A~0.offset_80))) (and (<= (+ .cse0 v_~A~0.offset_80 4) (select |v_#length_239| v_~A~0.base_80)) (let ((.cse1 (< |v_thread2Thread1of1ForFork0_#t~mem16#1_15| v_~maxA~0_34))) (or (and .cse1 |v_thread2Thread1of1ForFork0_#t~short17#1_29|) (and (not .cse1) .cse2))) (= (select |v_#valid_268| v_~A~0.base_80) 1) (<= 0 .cse3) (or (and (not |v_thread2Thread1of1ForFork0_#t~short19#1_31|) .cse2) (and |v_thread2Thread1of1ForFork0_#t~short17#1_29| |v_thread2Thread1of1ForFork0_#t~short19#1_31|)) (= (select (select |v_#memory_int_205| v_~A~0.base_80) .cse3) |v_thread2Thread1of1ForFork0_#t~mem16#1_15|)))) InVars {~A~0.base=v_~A~0.base_80, ~A~0.offset=v_~A~0.offset_80, #valid=|v_#valid_268|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_49|, #length=|v_#length_239|, ~maxA~0=v_~maxA~0_34} OutVars{~A~0.base=v_~A~0.base_80, thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_31|, ~A~0.offset=v_~A~0.offset_80, #valid=|v_#valid_268|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_15|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_49|, #length=|v_#length_239|, thread2Thread1of1ForFork0_#t~short17#1=|v_thread2Thread1of1ForFork0_#t~short17#1_29|, ~maxA~0=v_~maxA~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~short19#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_#t~short17#1] 40021#[L103-4, L62-7, thread1ENTRY]don't care [1453] L62-7-->L62-12: Formula: (let ((.cse0 (not |v_thread2Thread1of1ForFork0_#t~short21#1_Out_2|))) (or (and .cse0 (not |v_thread2Thread1of1ForFork0_#t~short19#1_In_1|) (= |v_thread2Thread1of1ForFork0_#t~short19#1_In_1| |v_thread2Thread1of1ForFork0_#t~short19#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem18#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem18#1_Out_2|)) (let ((.cse4 (* |v_thread2Thread1of1ForFork0_~i~1#1_In_3| 4))) (let ((.cse1 (+ .cse4 v_~B~0.offset_In_1)) (.cse2 (not |v_thread2Thread1of1ForFork0_#t~short19#1_Out_2|))) (and (= (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) .cse1) |v_thread2Thread1of1ForFork0_#t~mem18#1_Out_2|) |v_thread2Thread1of1ForFork0_#t~short19#1_In_1| (<= 0 .cse1) (or (and |v_thread2Thread1of1ForFork0_#t~short19#1_Out_2| |v_thread2Thread1of1ForFork0_#t~short21#1_Out_2|) (and .cse0 .cse2)) (let ((.cse3 (<= 0 |v_thread2Thread1of1ForFork0_#t~mem18#1_Out_2|))) (or (and |v_thread2Thread1of1ForFork0_#t~short19#1_Out_2| .cse3) (and (not .cse3) .cse2))) (= (select |v_#valid_In_1| v_~B~0.base_In_1) 1) (<= (+ .cse4 v_~B~0.offset_In_1 4) (select |v_#length_In_1| v_~B~0.base_In_1))))))) InVars {thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_In_1|, ~B~0.base=v_~B~0.base_In_1, #valid=|v_#valid_In_1|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, #length=|v_#length_In_1|, ~B~0.offset=v_~B~0.offset_In_1, thread2Thread1of1ForFork0_#t~mem18#1=|v_thread2Thread1of1ForFork0_#t~mem18#1_In_1|} OutVars{thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_Out_2|, ~B~0.base=v_~B~0.base_In_1, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_Out_2|, #valid=|v_#valid_In_1|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, #length=|v_#length_In_1|, ~B~0.offset=v_~B~0.offset_In_1, thread2Thread1of1ForFork0_#t~mem18#1=|v_thread2Thread1of1ForFork0_#t~mem18#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~short19#1, thread2Thread1of1ForFork0_#t~short21#1, thread2Thread1of1ForFork0_#t~mem18#1] 40705#[L103-4, L62-12, thread1ENTRY]don't care [1549] L62-12-->L62-18: Formula: (or (let ((.cse2 (* |v_thread2Thread1of1ForFork0_~i~1#1_In_5| 4))) (let ((.cse0 (+ .cse2 v_~B~0.offset_In_9))) (and (= (ite |v_thread2Thread1of1ForFork0_#t~short21#1_Out_6| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem20#1_Out_2| (select (select |v_#memory_int_In_11| v_~B~0.base_In_9) .cse0)) (<= 0 .cse0) (let ((.cse1 (< |v_thread2Thread1of1ForFork0_#t~mem20#1_Out_2| v_~maxB~0_In_3))) (or (and .cse1 |v_thread2Thread1of1ForFork0_#t~short21#1_Out_6|) (and (not .cse1) (not |v_thread2Thread1of1ForFork0_#t~short21#1_Out_6|)))) (= (select |v_#valid_In_17| v_~B~0.base_In_9) 1) |v_thread2Thread1of1ForFork0_#t~short21#1_In_1| (<= (+ .cse2 v_~B~0.offset_In_9 4) (select |v_#length_In_17| v_~B~0.base_In_9))))) (and (= |v_thread2Thread1of1ForFork0_#t~mem20#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem20#1_In_1|) (= (ite |v_thread2Thread1of1ForFork0_#t~short21#1_In_1| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~short21#1_In_1| |v_thread2Thread1of1ForFork0_#t~short21#1_Out_6|) (not |v_thread2Thread1of1ForFork0_#t~short21#1_In_1|))) InVars {~B~0.base=v_~B~0.base_In_9, thread2Thread1of1ForFork0_#t~mem20#1=|v_thread2Thread1of1ForFork0_#t~mem20#1_In_1|, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_In_1|, #valid=|v_#valid_In_17|, #memory_int=|v_#memory_int_In_11|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_5|, #length=|v_#length_In_17|, ~B~0.offset=v_~B~0.offset_In_9, ~maxB~0=v_~maxB~0_In_3} OutVars{thread2Thread1of1ForFork0_#t~mem20#1=|v_thread2Thread1of1ForFork0_#t~mem20#1_Out_2|, ~B~0.base=v_~B~0.base_In_9, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_Out_6|, #valid=|v_#valid_In_17|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, #memory_int=|v_#memory_int_In_11|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_5|, #length=|v_#length_In_17|, ~B~0.offset=v_~B~0.offset_In_9, ~maxB~0=v_~maxB~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem20#1, thread2Thread1of1ForFork0_#t~short21#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] 41955#[L103-4, L62-18, thread1ENTRY]don't care [1569] L62-18-->L61-4: Formula: (let ((.cse1 (* |v_thread2Thread1of1ForFork0_~i~1#1_68| 4))) (let ((.cse7 (+ v_~A~0.offset_124 .cse1))) (let ((.cse4 (* (select (select |v_#memory_int_303| v_~A~0.base_124) .cse7) 4))) (let ((.cse2 (+ v_~B~0.offset_128 .cse1)) (.cse0 (+ v_~mult~0.offset_93 .cse4))) (let ((.cse8 (select (select |v_#memory_$Pointer$.offset_158| v_~mult~0.base_93) .cse0)) (.cse9 (* (select (select |v_#memory_int_303| v_~B~0.base_128) .cse2) 4))) (let ((.cse3 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_15| |v_thread2Thread1of1ForFork0_plus_~b#1_15|)) (.cse5 (select (select |v_#memory_$Pointer$.base_158| v_~mult~0.base_93) .cse0)) (.cse6 (+ .cse8 .cse9))) (and (<= 0 .cse0) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_15| v_~res2~0_130) (<= (+ v_~B~0.offset_128 .cse1 4) (select |v_#length_401| v_~B~0.base_128)) (<= 0 .cse2) (= (ite (or (<= .cse3 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_15| 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= |v_thread2Thread1of1ForFork0_~i~1#1_67| (+ |v_thread2Thread1of1ForFork0_~i~1#1_68| 1)) (= |v_thread2Thread1of1ForFork0_plus_#res#1_15| .cse3) (= |v_thread2Thread1of1ForFork0_plus_#res#1_15| v_~res2~0_129) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38| 0)) (<= (+ v_~mult~0.offset_93 4 .cse4) (select |v_#length_401| v_~mult~0.base_93)) (= (select |v_#valid_454| .cse5) 1) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_15| (select (select |v_#memory_int_303| .cse5) .cse6)) (<= 0 .cse7) (= (select |v_#valid_454| v_~B~0.base_128) 1) (= (select |v_#valid_454| v_~A~0.base_124) 1) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_15| |v_thread2Thread1of1ForFork0_plus_~b#1_15| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_15|)) 1 0) 0)) (= (select |v_#valid_454| v_~mult~0.base_93) 1) (<= (+ .cse8 .cse9 4) (select |v_#length_401| .cse5)) (<= 0 .cse6) (= |v_thread2Thread1of1ForFork0_plus_~a#1_15| |v_thread2Thread1of1ForFork0_plus_#in~a#1_15|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= |v_thread2Thread1of1ForFork0_plus_~b#1_15| |v_thread2Thread1of1ForFork0_plus_#in~b#1_15|) (<= (+ v_~A~0.offset_124 .cse1 4) (select |v_#length_401| v_~A~0.base_124))))))))) InVars {~A~0.base=v_~A~0.base_124, ~B~0.base=v_~B~0.base_128, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_158|, ~mult~0.offset=v_~mult~0.offset_93, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_68|, ~A~0.offset=v_~A~0.offset_124, #valid=|v_#valid_454|, ~mult~0.base=v_~mult~0.base_93, #memory_int=|v_#memory_int_303|, #length=|v_#length_401|, ~B~0.offset=v_~B~0.offset_128, ~res2~0=v_~res2~0_130, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_158|} OutVars{~A~0.base=v_~A~0.base_124, ~B~0.base=v_~B~0.base_128, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_158|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_15|, ~mult~0.offset=v_~mult~0.offset_93, thread2Thread1of1ForFork0_#t~short21#1=|v_thread2Thread1of1ForFork0_#t~short21#1_49|, thread2Thread1of1ForFork0_#t~mem24#1.base=|v_thread2Thread1of1ForFork0_#t~mem24#1.base_15|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, thread2Thread1of1ForFork0_#t~mem22#1=|v_thread2Thread1of1ForFork0_#t~mem22#1_15|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_67|, thread2Thread1of1ForFork0_#t~short17#1=|v_thread2Thread1of1ForFork0_#t~short17#1_39|, thread2Thread1of1ForFork0_#t~mem18#1=|v_thread2Thread1of1ForFork0_#t~mem18#1_25|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_15|, thread2Thread1of1ForFork0_#t~short19#1=|v_thread2Thread1of1ForFork0_#t~short19#1_41|, thread2Thread1of1ForFork0_#t~mem20#1=|v_thread2Thread1of1ForFork0_#t~mem20#1_31|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_15|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_15|, thread2Thread1of1ForFork0_#t~mem23#1=|v_thread2Thread1of1ForFork0_#t~mem23#1_15|, #length=|v_#length_401|, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_27|, ~B~0.offset=v_~B~0.offset_128, ~res2~0=v_~res2~0_129, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_15|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_23|, thread2Thread1of1ForFork0_#t~mem25#1=|v_thread2Thread1of1ForFork0_#t~mem25#1_15|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_43|, thread2Thread1of1ForFork0_#t~ret26#1=|v_thread2Thread1of1ForFork0_#t~ret26#1_15|, ~A~0.offset=v_~A~0.offset_124, thread2Thread1of1ForFork0_#t~post14#1=|v_thread2Thread1of1ForFork0_#t~post14#1_25|, #valid=|v_#valid_454|, ~mult~0.base=v_~mult~0.base_93, #memory_int=|v_#memory_int_303|, thread2Thread1of1ForFork0_#t~mem24#1.offset=|v_thread2Thread1of1ForFork0_#t~mem24#1.offset_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_158|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_#t~short21#1, thread2Thread1of1ForFork0_#t~mem24#1.base, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem22#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~short17#1, thread2Thread1of1ForFork0_#t~mem18#1, thread2Thread1of1ForFork0_#t~mem25#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#t~short19#1, thread2Thread1of1ForFork0_#t~mem20#1, thread2Thread1of1ForFork0_#t~ret26#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_#t~mem23#1, thread2Thread1of1ForFork0_#t~post14#1, thread2Thread1of1ForFork0_#t~mem15#1, ~res2~0, thread2Thread1of1ForFork0_#t~mem24#1.offset] 39027#[L103-4, L61-4, thread1ENTRY]don't care [2022-07-26 14:15:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,730 INFO L85 PathProgramCache]: Analyzing trace with hash -767607018, now seen corresponding path program 2 times [2022-07-26 14:15:30,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478151100] [2022-07-26 14:15:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1351127176, now seen corresponding path program 1 times [2022-07-26 14:15:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777905609] [2022-07-26 14:15:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:30,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1295092077, now seen corresponding path program 1 times [2022-07-26 14:15:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190622067] [2022-07-26 14:15:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-26 14:15:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:30,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190622067] [2022-07-26 14:15:30,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190622067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:30,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:30,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-26 14:15:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42906471] [2022-07-26 14:15:30,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-26 14:15:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-26 14:15:31,333 INFO L87 Difference]: Start difference. First operand 1633 states and 5301 transitions. cyclomatic complexity: 3926 Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-07-26 14:15:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:31,480 INFO L93 Difference]: Finished difference Result 2101 states and 6355 transitions. [2022-07-26 14:15:31,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2101 states and 6355 transitions. [2022-07-26 14:15:31,490 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 1022 [2022-07-26 14:15:31,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2101 states to 1185 states and 3869 transitions. [2022-07-26 14:15:31,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1176 [2022-07-26 14:15:31,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1176 [2022-07-26 14:15:31,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1185 states and 3869 transitions. [2022-07-26 14:15:31,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:31,512 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1185 states and 3869 transitions. [2022-07-26 14:15:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states and 3869 transitions. [2022-07-26 14:15:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2022-07-26 14:15:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1185 states have (on average 3.2649789029535863) internal successors, (3869), 1184 states have internal predecessors, (3869), 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) [2022-07-26 14:15:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 3869 transitions. [2022-07-26 14:15:31,530 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1185 states and 3869 transitions. [2022-07-26 14:15:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:15:31,531 INFO L426 stractBuchiCegarLoop]: Abstraction has 1185 states and 3869 transitions. [2022-07-26 14:15:31,531 INFO L333 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-26 14:15:31,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1185 states and 3869 transitions. [2022-07-26 14:15:31,535 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 1022 [2022-07-26 14:15:31,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:31,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:31,536 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:31,536 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 14:15:31,536 INFO L733 eck$LassoCheckResult]: Stem: 45683#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 45321#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 45323#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 46005#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 45995#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 45485#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 45955#[L120-22]don't care [1544] L120-22-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~3#1_51| 4))) (let ((.cse0 (+ v_~mult~0.offset_79 .cse1))) (and (= (store |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|)) |v_#memory_$Pointer$.offset_146|) (<= 0 .cse0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_154|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|) (= (store |v_#memory_int_284| v_~mult~0.base_79 (store (select |v_#memory_int_284| v_~mult~0.base_79) .cse0 (select (select |v_#memory_int_283| v_~mult~0.base_79) .cse0))) |v_#memory_int_283|) (<= (+ v_~mult~0.offset_79 4 .cse1) (select |v_#length_361| v_~mult~0.base_79)) (= (select |v_#valid_408| v_~mult~0.base_79) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|) (= |v_ULTIMATE.start_main_~i~3#1_50| (+ |v_ULTIMATE.start_main_~i~3#1_51| 1)) (= (store |v_#memory_$Pointer$.base_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.base_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|)) |v_#memory_$Pointer$.base_146|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_147|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.base=v_~mult~0.base_79, ~mult~0.offset=v_~mult~0.offset_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_284|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_147|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_51|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_27|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_146|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.offset=v_~mult~0.offset_79, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_27|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_25|, ~mult~0.base=v_~mult~0.base_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_283|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_146|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_50|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret48#1.base, #memory_$Pointer$.base, ULTIMATE.start_main_#t~ret48#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~i~3#1] 45125#[L95-6]don't care [1546] L95-6-->L102-3: Formula: (and (= (ite (and (<= 0 v_~M~0_In_3) (< v_~M~0_In_3 v_~N~0_In_5)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (store |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.offset_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))) |v_#memory_$Pointer$.offset_Out_2|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (not (< |v_ULTIMATE.start_main_~i~3#1_In_3| v_~maxA~0_In_3)) (= (store |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#memory_$Pointer$.base_Out_2| (store |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.base_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_In_1|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_In_1|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_Out_2|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 44691#[L102-3]don't care [1196] L102-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork2_thidvar0_2 |v_ULTIMATE.start_main_#t~pre49#1_6|) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_4|, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_4|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_8|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_14|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_8|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_8|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_4|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_8|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_4|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_14|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_14|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_8|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_22|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 44693#[thread1ENTRY, L102-4]don't care [1065] thread1ENTRY-->L50-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] 44555#[L50-4, L102-4]don't care [2022-07-26 14:15:31,537 INFO L735 eck$LassoCheckResult]: Loop: 44555#[L50-4, L102-4]don't care [1207] L50-4-->L51-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_23| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_42))) (and (= (select (select |v_#memory_int_99| v_~A~0.base_42) .cse0) |v_thread1Thread1of1ForFork2_#t~mem2#1_9|) (<= (+ .cse1 v_~A~0.offset_42 4) (select |v_#length_111| v_~A~0.base_42)) (= (select |v_#valid_118| v_~A~0.base_42) 1) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork2_~i~0#1_23| v_~N~0_10)))) InVars {~A~0.base=v_~A~0.base_42, ~A~0.offset=v_~A~0.offset_42, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_99|, #length=|v_#length_111|, ~N~0=v_~N~0_10} OutVars{~A~0.base=v_~A~0.base_42, ~A~0.offset=v_~A~0.offset_42, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_99|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_9|, #length=|v_#length_111|, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2#1] 44561#[L51-1, L102-4]don't care [1488] L51-1-->L51-7: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_55| 4))) (let ((.cse1 (not |v_thread1Thread1of1ForFork2_#t~short4#1_31|)) (.cse3 (+ .cse2 v_~A~0.offset_88))) (and (let ((.cse0 (< |v_thread1Thread1of1ForFork2_#t~mem3#1_15| v_~maxA~0_52))) (or (and (not .cse0) .cse1) (and .cse0 |v_thread1Thread1of1ForFork2_#t~short4#1_31|))) (<= (+ .cse2 v_~A~0.offset_88 4) (select |v_#length_291| v_~A~0.base_88)) (= |v_thread1Thread1of1ForFork2_#t~mem3#1_15| (select (select |v_#memory_int_225| v_~A~0.base_88) .cse3)) (= (select |v_#valid_320| v_~A~0.base_88) 1) (or (and |v_thread1Thread1of1ForFork2_#t~short4#1_31| |v_thread1Thread1of1ForFork2_#t~short6#1_29|) (and .cse1 (not |v_thread1Thread1of1ForFork2_#t~short6#1_29|))) (<= 0 |v_thread1Thread1of1ForFork2_#t~mem2#1_19|) |v_thread1Thread1of1ForFork2_#t~short4#1_32| (<= 0 .cse3)))) InVars {~A~0.base=v_~A~0.base_88, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #valid=|v_#valid_320|, #memory_int=|v_#memory_int_225|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, #length=|v_#length_291|, ~maxA~0=v_~maxA~0_52} OutVars{~A~0.base=v_~A~0.base_88, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_29|, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #valid=|v_#valid_320|, #memory_int=|v_#memory_int_225|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, #length=|v_#length_291|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_31|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_15|, ~maxA~0=v_~maxA~0_52} AuxVars[|v_thread1Thread1of1ForFork2_#t~short4#1_32|] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~mem3#1] 45021#[L51-7, L102-4]don't care [1455] L51-7-->L51-12: Formula: (let ((.cse3 (not |v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|))) (or (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_In_3| 4))) (let ((.cse0 (+ .cse1 v_~B~0.offset_In_5)) (.cse2 (not |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|))) (and |v_thread1Thread1of1ForFork2_#t~short6#1_In_1| (<= 0 .cse0) (= (select |v_#valid_In_5| v_~B~0.base_In_5) 1) (<= (+ .cse1 v_~B~0.offset_In_5 4) (select |v_#length_In_5| v_~B~0.base_In_5)) (or (and |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2| |v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|) (and .cse2 .cse3)) (= (select (select |v_#memory_int_In_5| v_~B~0.base_In_5) .cse0) |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|) (let ((.cse4 (<= 0 |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|))) (or (and .cse2 (not .cse4)) (and |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2| .cse4)))))) (and (not |v_thread1Thread1of1ForFork2_#t~short6#1_In_1|) (= |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2| |v_thread1Thread1of1ForFork2_#t~mem5#1_In_1|) .cse3 (= |v_thread1Thread1of1ForFork2_#t~short6#1_In_1| |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|)))) InVars {thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_In_1|, ~B~0.base=v_~B~0.base_In_5, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ~B~0.offset=v_~B~0.offset_In_5} OutVars{thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|, ~B~0.base=v_~B~0.base_In_5, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|, ~B~0.offset=v_~B~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_#t~short8#1] 45023#[L102-4, L51-12]don't care [1404] L51-12-->L51-16: Formula: (let ((.cse0 (* |v_thread1Thread1of1ForFork2_~i~0#1_43| 4))) (let ((.cse1 (+ .cse0 v_~B~0.offset_74))) (and (<= (+ .cse0 v_~B~0.offset_74 4) (select |v_#length_217| v_~B~0.base_74)) (= |v_thread1Thread1of1ForFork2_#t~mem7#1_13| (select (select |v_#memory_int_191| v_~B~0.base_74) .cse1)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork2_#t~mem7#1_13| v_~maxB~0_23))) (or (and .cse2 |v_thread1Thread1of1ForFork2_#t~short8#1_29|) (and (not .cse2) (not |v_thread1Thread1of1ForFork2_#t~short8#1_29|)))) (= (select |v_#valid_234| v_~B~0.base_74) 1) |v_thread1Thread1of1ForFork2_#t~short8#1_30|))) InVars {~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_30|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} OutVars{~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_13|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_29|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~short8#1] 46153#[L102-4, L51-16]don't care [1557] L51-16-->L50-4: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_62| 4))) (let ((.cse9 (+ v_~A~0.offset_112 .cse2))) (let ((.cse8 (* (select (select |v_#memory_int_291| v_~A~0.base_112) .cse9) 4))) (let ((.cse7 (+ v_~B~0.offset_114 .cse2)) (.cse0 (+ v_~mult~0.offset_85 .cse8))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_150| v_~mult~0.base_85) .cse0)) (.cse4 (* (select (select |v_#memory_int_291| v_~B~0.base_114) .cse7) 4))) (let ((.cse6 (+ .cse3 .cse4)) (.cse1 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) (.cse5 (select (select |v_#memory_$Pointer$.base_150| v_~mult~0.base_85) .cse0))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (<= 0 .cse0) (= (select |v_#valid_426| v_~B~0.base_114) 1) (= v_~res1~0_70 |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) 1 0) 0)) (= (select |v_#valid_426| v_~mult~0.base_85) 1) (= .cse1 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_62| 1) |v_thread1Thread1of1ForFork2_~i~0#1_61|) (not (= (ite |v_thread1Thread1of1ForFork2_#t~short8#1_50| 1 0) 0)) (<= (+ v_~B~0.offset_114 .cse2 4) (select |v_#length_377| v_~B~0.base_114)) (<= (+ .cse3 .cse4 4) (select |v_#length_377| .cse5)) (<= 0 .cse6) (<= (+ v_~A~0.offset_112 .cse2 4) (select |v_#length_377| v_~A~0.base_112)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (= (select (select |v_#memory_int_291| .cse5) .cse6) |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (<= 0 .cse7) (<= (+ v_~mult~0.offset_85 4 .cse8) (select |v_#length_377| v_~mult~0.base_85)) (= (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_11| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= v_~res1~0_69 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (<= 0 .cse9) (= (select |v_#valid_426| v_~A~0.base_112) 1) (= |v_thread1Thread1of1ForFork2_plus_~b#1_11| |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (= (select |v_#valid_426| .cse5) 1) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0))))))))) InVars {~res1~0=v_~res1~0_70, ~A~0.base=v_~A~0.base_112, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_50|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_62|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, #length=|v_#length_377|, ~B~0.offset=v_~B~0.offset_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} OutVars{~res1~0=v_~res1~0_69, ~A~0.base=v_~A~0.base_112, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_11|, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_11|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_29|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_11|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_11|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_17|, #length=|v_#length_377|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_11|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_11|, ~B~0.offset=v_~B~0.offset_114, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_11|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_11|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_45|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_11|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_43|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_33|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_61|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_11|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 44555#[L50-4, L102-4]don't care [2022-07-26 14:15:31,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash -725788958, now seen corresponding path program 1 times [2022-07-26 14:15:31,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:31,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559367458] [2022-07-26 14:15:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:31,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:31,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:31,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:31,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:31,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1189091342, now seen corresponding path program 3 times [2022-07-26 14:15:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:31,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900761632] [2022-07-26 14:15:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:31,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:31,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash 553313741, now seen corresponding path program 1 times [2022-07-26 14:15:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:31,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565815655] [2022-07-26 14:15:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-26 14:15:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:31,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565815655] [2022-07-26 14:15:31,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565815655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:31,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:31,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-26 14:15:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096492363] [2022-07-26 14:15:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-26 14:15:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-26 14:15:32,043 INFO L87 Difference]: Start difference. First operand 1185 states and 3869 transitions. cyclomatic complexity: 2870 Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-07-26 14:15:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:32,220 INFO L93 Difference]: Finished difference Result 1503 states and 4675 transitions. [2022-07-26 14:15:32,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1503 states and 4675 transitions. [2022-07-26 14:15:32,227 INFO L131 ngComponentsAnalysis]: Automaton has 208 accepting balls. 1032 [2022-07-26 14:15:32,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1503 states to 1247 states and 3907 transitions. [2022-07-26 14:15:32,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1238 [2022-07-26 14:15:32,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1238 [2022-07-26 14:15:32,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1247 states and 3907 transitions. [2022-07-26 14:15:32,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:32,235 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1247 states and 3907 transitions. [2022-07-26 14:15:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states and 3907 transitions. [2022-07-26 14:15:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1211. [2022-07-26 14:15:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1211 states have (on average 3.176713459950454) internal successors, (3847), 1210 states have internal predecessors, (3847), 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) [2022-07-26 14:15:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 3847 transitions. [2022-07-26 14:15:32,254 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1211 states and 3847 transitions. [2022-07-26 14:15:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-26 14:15:32,254 INFO L426 stractBuchiCegarLoop]: Abstraction has 1211 states and 3847 transitions. [2022-07-26 14:15:32,254 INFO L333 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-26 14:15:32,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1211 states and 3847 transitions. [2022-07-26 14:15:32,258 INFO L131 ngComponentsAnalysis]: Automaton has 202 accepting balls. 1002 [2022-07-26 14:15:32,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:32,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:32,258 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:32,258 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 14:15:32,259 INFO L733 eck$LassoCheckResult]: Stem: 49535#[ULTIMATE.startENTRY]don't care [1591] ULTIMATE.startENTRY-->L120-6: Formula: (let ((.cse3 (store |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse2 (select |v_#memory_int_In_13| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= (select |v_#valid_In_23| 0) 0) (= v_~A~0.offset_Out_6 0) (= (select |v_#valid_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_11|) (= 0 |v_#NULL.base_Out_2|) (= (select |v_#valid_In_23| 1) 1) (= v_~mult~0.base_Out_6 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (= v_~res1~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (< 0 |v_#StackHeapBarrier_In_11|) (= v_~mult~0.offset_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select .cse2 0) 48) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30| 0)) (= v_~B~0.base_Out_6 0) (< |v_#StackHeapBarrier_In_11| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10| 0) (= v_~A~0.base_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|) (= (select .cse2 1) 0) (= v_~maxA~0_Out_6 0) (= (store (store (store (store |v_#length_In_23| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|)) |v_#length_Out_22|) (= (select |v_#valid_In_23| 2) 1) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_26|) (= v_~maxB~0_Out_6 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 2 (select |v_#length_In_23| 1)) (= v_~res2~0_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= (select |v_#length_In_23| 2) 33) (= v_~B~0.offset_Out_6 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)))))) InVars {#memory_int=|v_#memory_int_In_13|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, #length=|v_#length_In_23|, #valid=|v_#valid_In_23|} OutVars{~res1~0=v_~res1~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~A~0.base=v_~A~0.base_Out_6, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_Out_2|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_6|, #length=|v_#length_Out_22|, ~B~0.offset=v_~B~0.offset_Out_6, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_6|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_6|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_Out_6|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_18|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~maxB~0=v_~maxB~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_22|, #StackHeapBarrier=|v_#StackHeapBarrier_In_11|, ~M~0=v_~M~0_Out_2, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_Out_2|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_Out_2|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_6|, ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_Out_2|, ~B~0.base=v_~B~0.base_Out_6, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_Out_2|, ~mult~0.offset=v_~mult~0.offset_Out_6, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~maxA~0=v_~maxA~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_18|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_30|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_Out_6|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_Out_2|, ~res2~0=v_~res2~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_10|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_Out_2|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_6|, ~A~0.offset=v_~A~0.offset_Out_6, #valid=|v_#valid_Out_26|, ~mult~0.base=v_~mult~0.base_Out_6, #memory_int=|v_#memory_int_In_13|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_Out_2|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret43#1.base, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~M~0, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_main_#t~mem56#1, ~B~0.base, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ~mult~0.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~maxA~0, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~nondet52#1, ~res2~0, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ~A~0.offset, #valid, ~mult~0.base, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 49173#[L120-6]don't care [1502] L120-6-->L120-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89| 4) (select |v_#length_313| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|)) (= (select |v_#valid_342| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) 1) (= (store |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_int_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|)) |v_#memory_int_251|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|) (<= 0 .cse1) (= (store |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.offset_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.offset_126|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1 (select (select |v_#memory_$Pointer$.base_126| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|) .cse1))) |v_#memory_$Pointer$.base_126|)))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_101|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_59|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_127|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_252|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_127|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_100|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_89|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_126|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_89|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_63|, #valid=|v_#valid_342|, #memory_int=|v_#memory_int_251|, #length=|v_#length_313|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_126|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 49175#[L120-6]don't care [1587] L120-6-->L120-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9| v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|)) (= v_~A~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_9|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= v_~N~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (store |v_#valid_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1) |v_#valid_Out_22|) (= |v_#length_Out_18| (store |v_#length_In_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_9|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_9|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_9|, #valid=|v_#valid_In_21|, #length=|v_#length_In_21|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_17|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_Out_2|, ~N~0=v_~N~0_In_7, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_9|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, #valid=|v_#valid_Out_22|, #length=|v_#length_Out_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ~A~0.offset, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 49177#[L120-14]don't care [1487] L120-14-->L120-14: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83| 4) (select |v_#length_289| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_122|) (= (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.base_106|) (= (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1))) |v_#memory_$Pointer$.offset_106|) (= (select |v_#valid_318| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) 1) (<= 0 .cse1) (= |v_#memory_int_221| (store |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83| (store (select |v_#memory_int_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_95|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_53|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_222|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_83|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_106|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_83|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_59|, #valid=|v_#valid_318|, #memory_int=|v_#memory_int_221|, #length=|v_#length_289|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_106|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_122|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 49335#[L120-14]don't care [1581] L120-14-->L95-6: Formula: (and (= v_~mult~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#valid_In_19| v_~mult~0.base_Out_2 1) |v_#valid_Out_18|) (not (= v_~mult~0.base_Out_2 0)) (= |v_#length_Out_14| (store |v_#length_In_19| v_~mult~0.base_Out_2 (* v_~maxA~0_Out_2 4))) (= (select |v_#valid_In_19| v_~mult~0.base_Out_2) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|) (= |v_ULTIMATE.start_main_#t~nondet44#1_In_1| v_~maxA~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~B~0.offset_Out_2) (= v_~B~0.base_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|) (= v_~maxB~0_Out_2 |v_ULTIMATE.start_main_#t~nondet45#1_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod v_~maxA~0_Out_2 4294967296) 1073741823) 1 0)) (< v_~mult~0.base_Out_2 |v_#StackHeapBarrier_In_7|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|) (= |v_ULTIMATE.start_main_~i~3#1_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, #valid=|v_#valid_In_19|, #length=|v_#length_In_19|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, ~B~0.base=v_~B~0.base_Out_2, ~mult~0.offset=v_~mult~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ~maxA~0=v_~maxA~0_Out_2, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_Out_2|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ~maxB~0=v_~maxB~0_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ~mult~0.base=v_~mult~0.base_Out_2, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret43#1.offset, ~B~0.base, ULTIMATE.start_main_#t~nondet45#1, ~mult~0.offset, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~malloc46#1.base, ~maxA~0, ~maxB~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~mult~0.base, #valid, #length, ~B~0.offset, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_~i~3#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 49339#[L95-6]don't care [1580] L95-6-->L120-22: Formula: (and (< |v_ULTIMATE.start_main_~i~3#1_64| v_~maxA~0_82) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|) (= (store |v_#length_430| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4)) |v_#length_429|) (= (select |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| |v_ULTIMATE.start_create_fresh_int_array_~size#1_190|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_190| 4294967296) 1073741823) 1 0)) (= |v_#valid_482| (store |v_#valid_483| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61| v_~maxB~0_71) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147| |v_#StackHeapBarrier_85|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_85|, #valid=|v_#valid_483|, #length=|v_#length_430|, ~maxB~0=v_~maxB~0_71, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|, ~maxA~0=v_~maxA~0_82} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_147|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_88|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_147|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_91|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_117|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_190|, ~maxB~0=v_~maxB~0_71, ~maxA~0=v_~maxA~0_82, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_156|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_117|, #StackHeapBarrier=|v_#StackHeapBarrier_85|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_61|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_257|, #valid=|v_#valid_482|, #length=|v_#length_429|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_197|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 49805#[L120-22]don't care [1478] L120-22-->L120-22: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|))) (and (= (store |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.offset_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.offset_102|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79| 4) (select |v_#length_273| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|)) (= (select |v_#valid_302| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) 1) (= (store |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_$Pointer$.base_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0))) |v_#memory_$Pointer$.base_102|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|) (<= 0 .cse0) (= |v_#memory_int_215| (store |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79| (store (select |v_#memory_int_216| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|)))))) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_103|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_216|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_103|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_90|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_79|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_102|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_79|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_55|, #valid=|v_#valid_302|, #memory_int=|v_#memory_int_215|, #length=|v_#length_273|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_102|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, #memory_$Pointer$.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, #memory_int, #memory_$Pointer$.offset] 49813#[L120-22]don't care [1544] L120-22-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~3#1_51| 4))) (let ((.cse0 (+ v_~mult~0.offset_79 .cse1))) (and (= (store |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.offset_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|)) |v_#memory_$Pointer$.offset_146|) (<= 0 .cse0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116| |v_ULTIMATE.start_create_fresh_int_array_~size#1_154|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|) (= (store |v_#memory_int_284| v_~mult~0.base_79 (store (select |v_#memory_int_284| v_~mult~0.base_79) .cse0 (select (select |v_#memory_int_283| v_~mult~0.base_79) .cse0))) |v_#memory_int_283|) (<= (+ v_~mult~0.offset_79 4 .cse1) (select |v_#length_361| v_~mult~0.base_79)) (= (select |v_#valid_408| v_~mult~0.base_79) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|) (= |v_ULTIMATE.start_main_~i~3#1_50| (+ |v_ULTIMATE.start_main_~i~3#1_51| 1)) (= (store |v_#memory_$Pointer$.base_147| v_~mult~0.base_79 (store (select |v_#memory_$Pointer$.base_147| v_~mult~0.base_79) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|)) |v_#memory_$Pointer$.base_146|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_147|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.base=v_~mult~0.base_79, ~mult~0.offset=v_~mult~0.offset_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_284|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_147|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_51|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_27|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_146|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~mult~0.offset=v_~mult~0.offset_79, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_27|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_60|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_154|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_60|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_116|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_25|, ~mult~0.base=v_~mult~0.base_79, #valid=|v_#valid_408|, #memory_int=|v_#memory_int_283|, #length=|v_#length_361|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_146|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_50|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret48#1.base, #memory_$Pointer$.base, ULTIMATE.start_main_#t~ret48#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~i~3#1] 49803#[L95-6]don't care [1546] L95-6-->L102-3: Formula: (and (= (ite (and (<= 0 v_~M~0_In_3) (< v_~M~0_In_3 v_~N~0_In_5)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (store |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.offset_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.offset_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))) |v_#memory_$Pointer$.offset_Out_2|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (not (< |v_ULTIMATE.start_main_~i~3#1_In_3| v_~maxA~0_In_3)) (= (store |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre49#1_Out_2|)) |v_#memory_int_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_11| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#memory_$Pointer$.base_Out_2| (store |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_$Pointer$.base_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| (select (select |v_#memory_$Pointer$.base_Out_2| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|))))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_In_1|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_In_1|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_Out_2|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~maxA~0=v_~maxA~0_In_3, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, #valid=|v_#valid_In_11|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_In_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #memory_$Pointer$.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 49801#[L102-3]don't care [1196] L102-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork2_thidvar0_2 |v_ULTIMATE.start_main_#t~pre49#1_6|) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_4|, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_4|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_8|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_14|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_8|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_8|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_4|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_8|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_12|, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_4|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_14|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_14|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_8|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_6|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_22|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 49799#[thread1ENTRY, L102-4]don't care [1065] thread1ENTRY-->L50-4: Formula: (= |v_thread1Thread1of1ForFork2_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0#1] 49775#[L50-4, L102-4]don't care [2022-07-26 14:15:32,260 INFO L735 eck$LassoCheckResult]: Loop: 49775#[L50-4, L102-4]don't care [1207] L50-4-->L51-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_23| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_42))) (and (= (select (select |v_#memory_int_99| v_~A~0.base_42) .cse0) |v_thread1Thread1of1ForFork2_#t~mem2#1_9|) (<= (+ .cse1 v_~A~0.offset_42 4) (select |v_#length_111| v_~A~0.base_42)) (= (select |v_#valid_118| v_~A~0.base_42) 1) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork2_~i~0#1_23| v_~N~0_10)))) InVars {~A~0.base=v_~A~0.base_42, ~A~0.offset=v_~A~0.offset_42, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_99|, #length=|v_#length_111|, ~N~0=v_~N~0_10} OutVars{~A~0.base=v_~A~0.base_42, ~A~0.offset=v_~A~0.offset_42, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_99|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_9|, #length=|v_#length_111|, ~N~0=v_~N~0_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem2#1] 49787#[L51-1, L102-4]don't care [1488] L51-1-->L51-7: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_55| 4))) (let ((.cse1 (not |v_thread1Thread1of1ForFork2_#t~short4#1_31|)) (.cse3 (+ .cse2 v_~A~0.offset_88))) (and (let ((.cse0 (< |v_thread1Thread1of1ForFork2_#t~mem3#1_15| v_~maxA~0_52))) (or (and (not .cse0) .cse1) (and .cse0 |v_thread1Thread1of1ForFork2_#t~short4#1_31|))) (<= (+ .cse2 v_~A~0.offset_88 4) (select |v_#length_291| v_~A~0.base_88)) (= |v_thread1Thread1of1ForFork2_#t~mem3#1_15| (select (select |v_#memory_int_225| v_~A~0.base_88) .cse3)) (= (select |v_#valid_320| v_~A~0.base_88) 1) (or (and |v_thread1Thread1of1ForFork2_#t~short4#1_31| |v_thread1Thread1of1ForFork2_#t~short6#1_29|) (and .cse1 (not |v_thread1Thread1of1ForFork2_#t~short6#1_29|))) (<= 0 |v_thread1Thread1of1ForFork2_#t~mem2#1_19|) |v_thread1Thread1of1ForFork2_#t~short4#1_32| (<= 0 .cse3)))) InVars {~A~0.base=v_~A~0.base_88, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #valid=|v_#valid_320|, #memory_int=|v_#memory_int_225|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, #length=|v_#length_291|, ~maxA~0=v_~maxA~0_52} OutVars{~A~0.base=v_~A~0.base_88, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_29|, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_55|, #valid=|v_#valid_320|, #memory_int=|v_#memory_int_225|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, #length=|v_#length_291|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_31|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_15|, ~maxA~0=v_~maxA~0_52} AuxVars[|v_thread1Thread1of1ForFork2_#t~short4#1_32|] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~mem3#1] 49783#[L51-7, L102-4]don't care [1455] L51-7-->L51-12: Formula: (let ((.cse3 (not |v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|))) (or (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_In_3| 4))) (let ((.cse0 (+ .cse1 v_~B~0.offset_In_5)) (.cse2 (not |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|))) (and |v_thread1Thread1of1ForFork2_#t~short6#1_In_1| (<= 0 .cse0) (= (select |v_#valid_In_5| v_~B~0.base_In_5) 1) (<= (+ .cse1 v_~B~0.offset_In_5 4) (select |v_#length_In_5| v_~B~0.base_In_5)) (or (and |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2| |v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|) (and .cse2 .cse3)) (= (select (select |v_#memory_int_In_5| v_~B~0.base_In_5) .cse0) |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|) (let ((.cse4 (<= 0 |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|))) (or (and .cse2 (not .cse4)) (and |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2| .cse4)))))) (and (not |v_thread1Thread1of1ForFork2_#t~short6#1_In_1|) (= |v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2| |v_thread1Thread1of1ForFork2_#t~mem5#1_In_1|) .cse3 (= |v_thread1Thread1of1ForFork2_#t~short6#1_In_1| |v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|)))) InVars {thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_In_1|, ~B~0.base=v_~B~0.base_In_5, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_In_1|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, ~B~0.offset=v_~B~0.offset_In_5} OutVars{thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_Out_2|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_Out_2|, ~B~0.base=v_~B~0.base_In_5, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_5|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_Out_2|, ~B~0.offset=v_~B~0.offset_In_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_#t~short8#1] 49781#[L102-4, L51-12]don't care [1404] L51-12-->L51-16: Formula: (let ((.cse0 (* |v_thread1Thread1of1ForFork2_~i~0#1_43| 4))) (let ((.cse1 (+ .cse0 v_~B~0.offset_74))) (and (<= (+ .cse0 v_~B~0.offset_74 4) (select |v_#length_217| v_~B~0.base_74)) (= |v_thread1Thread1of1ForFork2_#t~mem7#1_13| (select (select |v_#memory_int_191| v_~B~0.base_74) .cse1)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork2_#t~mem7#1_13| v_~maxB~0_23))) (or (and .cse2 |v_thread1Thread1of1ForFork2_#t~short8#1_29|) (and (not .cse2) (not |v_thread1Thread1of1ForFork2_#t~short8#1_29|)))) (= (select |v_#valid_234| v_~B~0.base_74) 1) |v_thread1Thread1of1ForFork2_#t~short8#1_30|))) InVars {~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_30|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} OutVars{~B~0.base=v_~B~0.base_74, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_43|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_191|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_13|, #length=|v_#length_217|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_29|, ~B~0.offset=v_~B~0.offset_74, ~maxB~0=v_~maxB~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~short8#1] 49773#[L102-4, L51-16]don't care [1557] L51-16-->L50-4: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_62| 4))) (let ((.cse9 (+ v_~A~0.offset_112 .cse2))) (let ((.cse8 (* (select (select |v_#memory_int_291| v_~A~0.base_112) .cse9) 4))) (let ((.cse7 (+ v_~B~0.offset_114 .cse2)) (.cse0 (+ v_~mult~0.offset_85 .cse8))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_150| v_~mult~0.base_85) .cse0)) (.cse4 (* (select (select |v_#memory_int_291| v_~B~0.base_114) .cse7) 4))) (let ((.cse6 (+ .cse3 .cse4)) (.cse1 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) (.cse5 (select (select |v_#memory_$Pointer$.base_150| v_~mult~0.base_85) .cse0))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (<= 0 .cse0) (= (select |v_#valid_426| v_~B~0.base_114) 1) (= v_~res1~0_70 |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_~b#1_11| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork2_plus_~b#1_11|)) 1 0) 0)) (= (select |v_#valid_426| v_~mult~0.base_85) 1) (= .cse1 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_62| 1) |v_thread1Thread1of1ForFork2_~i~0#1_61|) (not (= (ite |v_thread1Thread1of1ForFork2_#t~short8#1_50| 1 0) 0)) (<= (+ v_~B~0.offset_114 .cse2 4) (select |v_#length_377| v_~B~0.base_114)) (<= (+ .cse3 .cse4 4) (select |v_#length_377| .cse5)) (<= 0 .cse6) (<= (+ v_~A~0.offset_112 .cse2 4) (select |v_#length_377| v_~A~0.base_112)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_11| |v_thread1Thread1of1ForFork2_plus_#in~a#1_11|) (= (select (select |v_#memory_int_291| .cse5) .cse6) |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (<= 0 .cse7) (<= (+ v_~mult~0.offset_85 4 .cse8) (select |v_#length_377| v_~mult~0.base_85)) (= (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_11| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|) (= v_~res1~0_69 |v_thread1Thread1of1ForFork2_plus_#res#1_11|) (<= 0 .cse9) (= (select |v_#valid_426| v_~A~0.base_112) 1) (= |v_thread1Thread1of1ForFork2_plus_~b#1_11| |v_thread1Thread1of1ForFork2_plus_#in~b#1_11|) (= (select |v_#valid_426| .cse5) 1) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0))))))))) InVars {~res1~0=v_~res1~0_70, ~A~0.base=v_~A~0.base_112, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_50|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_62|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, #length=|v_#length_377|, ~B~0.offset=v_~B~0.offset_114, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} OutVars{~res1~0=v_~res1~0_69, ~A~0.base=v_~A~0.base_112, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_11|, ~B~0.base=v_~B~0.base_114, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_150|, ~mult~0.offset=v_~mult~0.offset_85, thread1Thread1of1ForFork2_#t~mem12#1=|v_thread1Thread1of1ForFork2_#t~mem12#1_11|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_29|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_11|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, thread1Thread1of1ForFork2_#t~mem11#1.base=|v_thread1Thread1of1ForFork2_#t~mem11#1.base_11|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_17|, #length=|v_#length_377|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_11|, thread1Thread1of1ForFork2_#t~mem11#1.offset=|v_thread1Thread1of1ForFork2_#t~mem11#1.offset_11|, ~B~0.offset=v_~B~0.offset_114, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork2_#t~mem9#1=|v_thread1Thread1of1ForFork2_#t~mem9#1_11|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_11|, thread1Thread1of1ForFork2_#t~short4#1=|v_thread1Thread1of1ForFork2_#t~short4#1_45|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_11|, thread1Thread1of1ForFork2_#t~short6#1=|v_thread1Thread1of1ForFork2_#t~short6#1_43|, ~A~0.offset=v_~A~0.offset_112, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_33|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_61|, thread1Thread1of1ForFork2_#t~ret13#1=|v_thread1Thread1of1ForFork2_#t~ret13#1_11|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_37|, #valid=|v_#valid_426|, ~mult~0.base=v_~mult~0.base_85, #memory_int=|v_#memory_int_291|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_11|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_150|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem9#1, thread1Thread1of1ForFork2_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~short4#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~short6#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_#t~ret13#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem11#1.base, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem11#1.offset, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] 49775#[L50-4, L102-4]don't care [2022-07-26 14:15:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:32,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1085291710, now seen corresponding path program 1 times [2022-07-26 14:15:32,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:32,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125171632] [2022-07-26 14:15:32,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:32,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:32,277 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:32,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1189091342, now seen corresponding path program 4 times [2022-07-26 14:15:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:32,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392591597] [2022-07-26 14:15:32,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:32,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:32,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:32,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -253938323, now seen corresponding path program 1 times [2022-07-26 14:15:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:32,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001656444] [2022-07-26 14:15:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:32,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:32,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:32,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:43,158 WARN L233 SmtUtils]: Spent 10.31s on a formula simplification. DAG size of input: 411 DAG size of output: 365 (called from [L 277] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-26 14:15:47,971 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:47,971 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:47,971 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:47,971 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:47,971 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:47,971 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:47,971 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:47,971 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:47,971 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-dot-product-alt.wvr.c_BEv2_Iteration15_Lasso [2022-07-26 14:15:47,971 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:47,971 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:47,975 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,977 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,978 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,980 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,982 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,983 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,985 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,986 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,987 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,989 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,990 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,992 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,993 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,995 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,996 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,998 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:47,999 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,001 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,002 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,004 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,006 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,008 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,009 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,010 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,012 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,013 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,014 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,016 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,017 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,018 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,020 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,021 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,023 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,024 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,028 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,029 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,030 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,032 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,033 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,035 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,038 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,039 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,041 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:48,042 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,514 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,521 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,522 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,523 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,524 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,525 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,526 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,527 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,528 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,529 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,529 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,530 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:51,531 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:52,910 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:52,910 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:52,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:52,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:52,911 INFO L229 MonitoredProcess]: Starting monitored process 135 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) [2022-07-26 14:15:52,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-26 14:15:52,916 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 [2022-07-26 14:15:52,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:52,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:52,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:52,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:52,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:52,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:52,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:52,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:52,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:52,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:52,955 INFO L229 MonitoredProcess]: Starting monitored process 136 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) [2022-07-26 14:15:52,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-26 14:15:52,958 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 [2022-07-26 14:15:52,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:52,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:52,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:52,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:52,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:52,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:52,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:52,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:52,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,002 INFO L229 MonitoredProcess]: Starting monitored process 137 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) [2022-07-26 14:15:53,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-26 14:15:53,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:53,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,028 INFO L229 MonitoredProcess]: Starting monitored process 138 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) [2022-07-26 14:15:53,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-26 14:15:53,030 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 [2022-07-26 14:15:53,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,055 INFO L229 MonitoredProcess]: Starting monitored process 139 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) [2022-07-26 14:15:53,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-26 14:15:53,056 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 [2022-07-26 14:15:53,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-26 14:15:53,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,084 INFO L229 MonitoredProcess]: Starting monitored process 140 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) [2022-07-26 14:15:53,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-26 14:15:53,086 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 [2022-07-26 14:15:53,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2022-07-26 14:15:53,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,117 INFO L229 MonitoredProcess]: Starting monitored process 141 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) [2022-07-26 14:15:53,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-26 14:15:53,119 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 [2022-07-26 14:15:53,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-07-26 14:15:53,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,156 INFO L229 MonitoredProcess]: Starting monitored process 142 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) [2022-07-26 14:15:53,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-26 14:15:53,171 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 [2022-07-26 14:15:53,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,205 INFO L229 MonitoredProcess]: Starting monitored process 143 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) [2022-07-26 14:15:53,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-07-26 14:15:53,207 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 [2022-07-26 14:15:53,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-07-26 14:15:53,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,231 INFO L229 MonitoredProcess]: Starting monitored process 144 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) [2022-07-26 14:15:53,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-07-26 14:15:53,233 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 [2022-07-26 14:15:53,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-07-26 14:15:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,257 INFO L229 MonitoredProcess]: Starting monitored process 145 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) [2022-07-26 14:15:53,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-07-26 14:15:53,259 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 [2022-07-26 14:15:53,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2022-07-26 14:15:53,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,282 INFO L229 MonitoredProcess]: Starting monitored process 146 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) [2022-07-26 14:15:53,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-07-26 14:15:53,284 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 [2022-07-26 14:15:53,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2022-07-26 14:15:53,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,309 INFO L229 MonitoredProcess]: Starting monitored process 147 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) [2022-07-26 14:15:53,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-07-26 14:15:53,310 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 [2022-07-26 14:15:53,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-07-26 14:15:53,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,334 INFO L229 MonitoredProcess]: Starting monitored process 148 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) [2022-07-26 14:15:53,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-07-26 14:15:53,335 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 [2022-07-26 14:15:53,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2022-07-26 14:15:53,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,359 INFO L229 MonitoredProcess]: Starting monitored process 149 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) [2022-07-26 14:15:53,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-07-26 14:15:53,361 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 [2022-07-26 14:15:53,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,386 INFO L229 MonitoredProcess]: Starting monitored process 150 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) [2022-07-26 14:15:53,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-07-26 14:15:53,388 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 [2022-07-26 14:15:53,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2022-07-26 14:15:53,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,410 INFO L229 MonitoredProcess]: Starting monitored process 151 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) [2022-07-26 14:15:53,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-07-26 14:15:53,412 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 [2022-07-26 14:15:53,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-07-26 14:15:53,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,438 INFO L229 MonitoredProcess]: Starting monitored process 152 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) [2022-07-26 14:15:53,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-07-26 14:15:53,440 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 [2022-07-26 14:15:53,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,478 INFO L229 MonitoredProcess]: Starting monitored process 153 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) [2022-07-26 14:15:53,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-07-26 14:15:53,480 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 [2022-07-26 14:15:53,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,518 INFO L229 MonitoredProcess]: Starting monitored process 154 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) [2022-07-26 14:15:53,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-07-26 14:15:53,520 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 [2022-07-26 14:15:53,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,555 INFO L229 MonitoredProcess]: Starting monitored process 155 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) [2022-07-26 14:15:53,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-07-26 14:15:53,559 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 [2022-07-26 14:15:53,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,583 INFO L229 MonitoredProcess]: Starting monitored process 156 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) [2022-07-26 14:15:53,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-07-26 14:15:53,586 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 [2022-07-26 14:15:53,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,608 INFO L229 MonitoredProcess]: Starting monitored process 157 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) [2022-07-26 14:15:53,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-07-26 14:15:53,610 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 [2022-07-26 14:15:53,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2022-07-26 14:15:53,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,632 INFO L229 MonitoredProcess]: Starting monitored process 158 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) [2022-07-26 14:15:53,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-07-26 14:15:53,634 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 [2022-07-26 14:15:53,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,656 INFO L229 MonitoredProcess]: Starting monitored process 159 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) [2022-07-26 14:15:53,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-07-26 14:15:53,658 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 [2022-07-26 14:15:53,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,691 INFO L229 MonitoredProcess]: Starting monitored process 160 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) [2022-07-26 14:15:53,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-07-26 14:15:53,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:53,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2022-07-26 14:15:53,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,741 INFO L229 MonitoredProcess]: Starting monitored process 161 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) [2022-07-26 14:15:53,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-07-26 14:15:53,744 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 [2022-07-26 14:15:53,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,776 INFO L229 MonitoredProcess]: Starting monitored process 162 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) [2022-07-26 14:15:53,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-07-26 14:15:53,777 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 [2022-07-26 14:15:53,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2022-07-26 14:15:53,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,800 INFO L229 MonitoredProcess]: Starting monitored process 163 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) [2022-07-26 14:15:53,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-07-26 14:15:53,803 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 [2022-07-26 14:15:53,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,834 INFO L229 MonitoredProcess]: Starting monitored process 164 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) [2022-07-26 14:15:53,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-07-26 14:15:53,836 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 [2022-07-26 14:15:53,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-07-26 14:15:53,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,859 INFO L229 MonitoredProcess]: Starting monitored process 165 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) [2022-07-26 14:15:53,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-07-26 14:15:53,860 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 [2022-07-26 14:15:53,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,882 INFO L229 MonitoredProcess]: Starting monitored process 166 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) [2022-07-26 14:15:53,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2022-07-26 14:15:53,884 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 [2022-07-26 14:15:53,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:53,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:53,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:53,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,919 INFO L229 MonitoredProcess]: Starting monitored process 167 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) [2022-07-26 14:15:53,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2022-07-26 14:15:53,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:53,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2022-07-26 14:15:53,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,946 INFO L229 MonitoredProcess]: Starting monitored process 168 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) [2022-07-26 14:15:53,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2022-07-26 14:15:53,948 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 [2022-07-26 14:15:53,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:53,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2022-07-26 14:15:53,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:53,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:53,971 INFO L229 MonitoredProcess]: Starting monitored process 169 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) [2022-07-26 14:15:53,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2022-07-26 14:15:53,973 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 [2022-07-26 14:15:53,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:53,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:53,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:53,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:53,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:53,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:53,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:53,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,010 INFO L229 MonitoredProcess]: Starting monitored process 170 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) [2022-07-26 14:15:54,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2022-07-26 14:15:54,011 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 [2022-07-26 14:15:54,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2022-07-26 14:15:54,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,033 INFO L229 MonitoredProcess]: Starting monitored process 171 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) [2022-07-26 14:15:54,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2022-07-26 14:15:54,035 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 [2022-07-26 14:15:54,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2022-07-26 14:15:54,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,058 INFO L229 MonitoredProcess]: Starting monitored process 172 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) [2022-07-26 14:15:54,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2022-07-26 14:15:54,060 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 [2022-07-26 14:15:54,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2022-07-26 14:15:54,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,082 INFO L229 MonitoredProcess]: Starting monitored process 173 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) [2022-07-26 14:15:54,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2022-07-26 14:15:54,084 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 [2022-07-26 14:15:54,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,121 INFO L229 MonitoredProcess]: Starting monitored process 174 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) [2022-07-26 14:15:54,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2022-07-26 14:15:54,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:54,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2022-07-26 14:15:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,156 INFO L229 MonitoredProcess]: Starting monitored process 175 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) [2022-07-26 14:15:54,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2022-07-26 14:15:54,158 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 [2022-07-26 14:15:54,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2022-07-26 14:15:54,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,180 INFO L229 MonitoredProcess]: Starting monitored process 176 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) [2022-07-26 14:15:54,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2022-07-26 14:15:54,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 [2022-07-26 14:15:54,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2022-07-26 14:15:54,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,204 INFO L229 MonitoredProcess]: Starting monitored process 177 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) [2022-07-26 14:15:54,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2022-07-26 14:15:54,206 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 [2022-07-26 14:15:54,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2022-07-26 14:15:54,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,243 INFO L229 MonitoredProcess]: Starting monitored process 178 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) [2022-07-26 14:15:54,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2022-07-26 14:15:54,245 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 [2022-07-26 14:15:54,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2022-07-26 14:15:54,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,275 INFO L229 MonitoredProcess]: Starting monitored process 179 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) [2022-07-26 14:15:54,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2022-07-26 14:15:54,277 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 [2022-07-26 14:15:54,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2022-07-26 14:15:54,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,300 INFO L229 MonitoredProcess]: Starting monitored process 180 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) [2022-07-26 14:15:54,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2022-07-26 14:15:54,302 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 [2022-07-26 14:15:54,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,339 INFO L229 MonitoredProcess]: Starting monitored process 181 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) [2022-07-26 14:15:54,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-07-26 14:15:54,347 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 [2022-07-26 14:15:54,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,383 INFO L229 MonitoredProcess]: Starting monitored process 182 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) [2022-07-26 14:15:54,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-07-26 14:15:54,384 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 [2022-07-26 14:15:54,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2022-07-26 14:15:54,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,408 INFO L229 MonitoredProcess]: Starting monitored process 183 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) [2022-07-26 14:15:54,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-07-26 14:15:54,410 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 [2022-07-26 14:15:54,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2022-07-26 14:15:54,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,433 INFO L229 MonitoredProcess]: Starting monitored process 184 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) [2022-07-26 14:15:54,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-07-26 14:15:54,434 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 [2022-07-26 14:15:54,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,459 INFO L229 MonitoredProcess]: Starting monitored process 185 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) [2022-07-26 14:15:54,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2022-07-26 14:15:54,461 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 [2022-07-26 14:15:54,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,521 INFO L229 MonitoredProcess]: Starting monitored process 186 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) [2022-07-26 14:15:54,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2022-07-26 14:15:54,523 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 [2022-07-26 14:15:54,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,604 INFO L229 MonitoredProcess]: Starting monitored process 187 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) [2022-07-26 14:15:54,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2022-07-26 14:15:54,606 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 [2022-07-26 14:15:54,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,651 INFO L229 MonitoredProcess]: Starting monitored process 188 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) [2022-07-26 14:15:54,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2022-07-26 14:15:54,653 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 [2022-07-26 14:15:54,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,710 INFO L229 MonitoredProcess]: Starting monitored process 189 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) [2022-07-26 14:15:54,733 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 [2022-07-26 14:15:54,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:54,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:54,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:54,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2022-07-26 14:15:54,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,772 INFO L229 MonitoredProcess]: Starting monitored process 190 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) [2022-07-26 14:15:54,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2022-07-26 14:15:54,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 [2022-07-26 14:15:54,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,810 INFO L229 MonitoredProcess]: Starting monitored process 191 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) [2022-07-26 14:15:54,824 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 [2022-07-26 14:15:54,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2022-07-26 14:15:54,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,866 INFO L229 MonitoredProcess]: Starting monitored process 192 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) [2022-07-26 14:15:54,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2022-07-26 14:15:54,883 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 [2022-07-26 14:15:54,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,911 INFO L229 MonitoredProcess]: Starting monitored process 193 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) [2022-07-26 14:15:54,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2022-07-26 14:15:54,913 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 [2022-07-26 14:15:54,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,947 INFO L229 MonitoredProcess]: Starting monitored process 194 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) [2022-07-26 14:15:54,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2022-07-26 14:15:54,949 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 [2022-07-26 14:15:54,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:54,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:54,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:54,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:54,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:54,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:54,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:54,975 INFO L229 MonitoredProcess]: Starting monitored process 195 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) [2022-07-26 14:15:54,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2022-07-26 14:15:54,977 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 [2022-07-26 14:15:54,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:54,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:54,983 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 14:15:54,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:54,996 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-26 14:15:54,996 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 14:15:55,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:55,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:55,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:55,028 INFO L229 MonitoredProcess]: Starting monitored process 196 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) [2022-07-26 14:15:55,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2022-07-26 14:15:55,030 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 [2022-07-26 14:15:55,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:55,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:55,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:55,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:55,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:55,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:55,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:55,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2022-07-26 14:15:55,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:55,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:55,054 INFO L229 MonitoredProcess]: Starting monitored process 197 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) [2022-07-26 14:15:55,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2022-07-26 14:15:55,077 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 [2022-07-26 14:15:55,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:55,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:55,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:55,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:55,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:55,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:55,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:55,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:55,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:55,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:55,107 INFO L229 MonitoredProcess]: Starting monitored process 198 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) [2022-07-26 14:15:55,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2022-07-26 14:15:55,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:55,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:55,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:55,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:55,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:55,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:55,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:55,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:55,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:55,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:55,135 INFO L229 MonitoredProcess]: Starting monitored process 199 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) [2022-07-26 14:15:55,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2022-07-26 14:15:55,138 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 [2022-07-26 14:15:55,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:55,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:55,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:55,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:55,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:55,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:55,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:55,314 INFO L443 ModelExtractionUtils]: Simplification made 54 calls to the SMT solver. [2022-07-26 14:15:55,315 INFO L444 ModelExtractionUtils]: 22 out of 79 variables were initially zero. Simplification set additionally 52 variables to zero. [2022-07-26 14:15:55,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:55,316 INFO L229 MonitoredProcess]: Starting monitored process 200 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) [2022-07-26 14:15:55,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2022-07-26 14:15:55,331 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:55,351 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:15:55,351 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:55,351 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~maxA~0, thread1Thread1of1ForFork2_~i~0#1) = 2*~maxA~0 - 1*thread1Thread1of1ForFork2_~i~0#1 Supporting invariants [4*~maxA~0 - 1*v_rep(select #length ~A~0.base)_5 >= 0] [2022-07-26 14:15:55,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:55,611 INFO L156 tatePredicateManager]: 58 out of 61 supporting invariants were superfluous and have been removed [2022-07-26 14:15:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:55,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-26 14:15:55,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:55,736 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:15:55,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:15:55,778 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:15:55,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:15:55,834 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-26 14:15:55,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-26 14:15:55,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-26 14:15:55,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:15:55,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-26 14:15:55,886 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-26 14:15:55,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-26 14:15:55,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:15:55,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-26 14:15:55,937 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-26 14:15:55,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-26 14:15:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:55,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-26 14:15:55,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:56,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2022-07-26 14:15:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:56,291 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2022-07-26 14:15:56,291 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842 Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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) [2022-07-26 14:15:56,679 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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 2136 states and 7164 transitions. Complement of second has 8 states. [2022-07-26 14:15:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-26 14:15:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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) [2022-07-26 14:15:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-07-26 14:15:56,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 139 transitions. Stem has 11 letters. Loop has 5 letters. [2022-07-26 14:15:56,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:56,680 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-26 14:15:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:56,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:56,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-26 14:15:56,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:56,827 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:15:56,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:15:56,879 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:15:56,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:15:56,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:15:56,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-26 14:15:56,957 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-26 14:15:56,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-26 14:15:56,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:15:56,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-26 14:15:56,998 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-26 14:15:56,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-26 14:15:57,031 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-26 14:15:57,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-26 14:15:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:57,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-26 14:15:57,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:57,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2022-07-26 14:15:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:57,500 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 5 loop predicates [2022-07-26 14:15:57,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842 Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) [2022-07-26 14:15:58,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 5873 states and 19900 transitions. Complement of second has 18 states. [2022-07-26 14:15:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 9 stem states 3 non-accepting loop states 2 accepting loop states [2022-07-26 14:15:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) [2022-07-26 14:15:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 221 transitions. [2022-07-26 14:15:58,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 221 transitions. Stem has 11 letters. Loop has 5 letters. [2022-07-26 14:15:58,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:58,127 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-26 14:15:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:58,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-26 14:15:58,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:58,229 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:15:58,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:15:58,268 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:15:58,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:15:58,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:15:58,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-26 14:15:58,340 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-26 14:15:58,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-26 14:15:58,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:15:58,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-26 14:15:58,384 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-26 14:15:58,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-26 14:15:58,417 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-26 14:15:58,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-26 14:15:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:58,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-26 14:15:58,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:58,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2022-07-26 14:15:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:58,894 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 5 loop predicates [2022-07-26 14:15:58,895 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842 Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) [2022-07-26 14:15:59,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 9313 states and 31642 transitions. Complement of second has 33 states. [2022-07-26 14:15:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 9 stem states 3 non-accepting loop states 2 accepting loop states [2022-07-26 14:15:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) [2022-07-26 14:15:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 289 transitions. [2022-07-26 14:15:59,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 289 transitions. Stem has 11 letters. Loop has 5 letters. [2022-07-26 14:15:59,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:59,592 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-26 14:15:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:59,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-26 14:15:59,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:59,722 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:15:59,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:15:59,763 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:15:59,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:15:59,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:15:59,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-26 14:15:59,838 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-26 14:15:59,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-26 14:15:59,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:15:59,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-26 14:15:59,895 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-26 14:15:59,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-26 14:15:59,934 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-26 14:15:59,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-26 14:16:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:00,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-26 14:16:00,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:00,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2022-07-26 14:16:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:16:00,353 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.8 stem predicates 5 loop predicates [2022-07-26 14:16:00,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842 Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) [2022-07-26 14:16:00,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 2978 states and 10057 transitions. Complement of second has 6 states. [2022-07-26 14:16:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-26 14:16:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) [2022-07-26 14:16:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-07-26 14:16:00,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 11 letters. Loop has 5 letters. [2022-07-26 14:16:00,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:16:00,589 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-26 14:16:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:16:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:00,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-26 14:16:00,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:00,697 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:16:00,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:16:00,736 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-07-26 14:16:00,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-07-26 14:16:00,807 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-26 14:16:00,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-26 14:16:00,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-26 14:16:00,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 14:16:00,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-26 14:16:00,889 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-26 14:16:00,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-26 14:16:00,921 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-26 14:16:00,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-26 14:16:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:16:01,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-26 14:16:01,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:16:01,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2022-07-26 14:16:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:16:01,310 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.8 stem predicates 5 loop predicates [2022-07-26 14:16:01,310 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 1211 states and 3847 transitions. cyclomatic complexity: 2842 Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) [2022-07-26 14:16:01,317 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: determinize is only required for construction of interpolant automaton, not for refinement at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PredicateFactoryRefinement.determinize(PredicateFactoryRefinement.java:104) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PredicateFactoryForInterpolantAutomata.determinize(PredicateFactoryForInterpolantAutomata.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.oldapi.DeterminizedState.getContent(DeterminizedState.java:118) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.PowersetDeterminizer.getState(PowersetDeterminizer.java:180) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiComplementFKVNwa.constructSinkState(BuchiComplementFKVNwa.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiComplementFKVNwa.(BuchiComplementFKVNwa.java:146) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiDifferenceFKV.constructResult(BuchiDifferenceFKV.java:116) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiDifferenceFKV.(BuchiDifferenceFKV.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.rankBasedOptimization(RefineBuchi.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineBuchiInternal(AbstractBuchiCegarLoop.java:582) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:402) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-26 14:16:01,318 INFO L158 Benchmark]: Toolchain (without parser) took 75622.13ms. Allocated memory was 221.2MB in the beginning and 584.1MB in the end (delta: 362.8MB). Free memory was 170.2MB in the beginning and 431.0MB in the end (delta: -260.8MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. [2022-07-26 14:16:01,319 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory is still 186.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:16:01,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.63ms. Allocated memory is still 221.2MB. Free memory was 169.8MB in the beginning and 194.3MB in the end (delta: -24.5MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-07-26 14:16:01,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.30ms. Allocated memory is still 221.2MB. Free memory was 194.3MB in the beginning and 191.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-07-26 14:16:01,319 INFO L158 Benchmark]: Boogie Preprocessor took 23.09ms. Allocated memory is still 221.2MB. Free memory was 191.2MB in the beginning and 189.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:16:01,319 INFO L158 Benchmark]: RCFGBuilder took 679.43ms. Allocated memory was 221.2MB in the beginning and 304.1MB in the end (delta: 82.8MB). Free memory was 189.1MB in the beginning and 275.4MB in the end (delta: -86.3MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. [2022-07-26 14:16:01,320 INFO L158 Benchmark]: BuchiAutomizer took 74570.16ms. Allocated memory was 304.1MB in the beginning and 584.1MB in the end (delta: 280.0MB). Free memory was 275.4MB in the beginning and 431.0MB in the end (delta: -155.6MB). Peak memory consumption was 124.9MB. Max. memory is 8.0GB. [2022-07-26 14:16:01,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory is still 186.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.63ms. Allocated memory is still 221.2MB. Free memory was 169.8MB in the beginning and 194.3MB in the end (delta: -24.5MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.30ms. Allocated memory is still 221.2MB. Free memory was 194.3MB in the beginning and 191.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.09ms. Allocated memory is still 221.2MB. Free memory was 191.2MB in the beginning and 189.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 679.43ms. Allocated memory was 221.2MB in the beginning and 304.1MB in the end (delta: 82.8MB). Free memory was 189.1MB in the beginning and 275.4MB in the end (delta: -86.3MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 74570.16ms. Allocated memory was 304.1MB in the beginning and 584.1MB in the end (delta: 280.0MB). Free memory was 275.4MB in the beginning and 431.0MB in the end (delta: -155.6MB). Peak memory consumption was 124.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9s, 316 PlacesBefore, 41 PlacesAfterwards, 341 TransitionsBefore, 42 TransitionsAfterwards, 13038 CoEnabledTransitionPairs, 8 FixpointIterations, 175 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 50 TrivialYvCompositions, 46 ConcurrentYvCompositions, 24 ChoiceCompositions, 393 TotalNumberOfCompositions, 15140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13325, positive: 13204, positive conditional: 0, positive unconditional: 13204, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7811, positive: 7768, positive conditional: 0, positive unconditional: 7768, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13325, positive: 5436, positive conditional: 0, positive unconditional: 5436, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 7811, unknown conditional: 0, unknown unconditional: 7811] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 177, Positive conditional cache size: 0, Positive unconditional cache size: 177, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - ExceptionOrErrorResult: AssertionError: determinize is only required for construction of interpolant automaton, not for refinement de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: determinize is only required for construction of interpolant automaton, not for refinement: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PredicateFactoryRefinement.determinize(PredicateFactoryRefinement.java:104) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-26 14:16:01,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-07-26 14:16:01,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-07-26 14:16:01,756 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...