/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-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:02:32,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:02:32,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:02:32,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:02:32,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:02:32,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:02:32,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:02:32,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:02:32,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:02:32,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:02:32,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:02:32,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:02:32,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:02:32,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:02:32,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:02:32,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:02:32,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:02:32,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:02:32,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:02:32,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:02:32,498 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:02:32,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:02:32,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:02:32,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:02:32,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:02:32,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:02:32,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:02:32,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:02:32,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:02:32,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:02:32,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:02:32,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:02:32,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:02:32,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:02:32,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:02:32,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:02:32,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:02:32,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:02:32,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:02:32,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:02:32,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:02:32,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:02:32,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 12:02:32,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:02:32,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:02:32,585 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:02:32,585 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:02:32,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:02:32,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:02:32,587 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:02:32,588 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:02:32,588 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:02:32,588 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:02:32,588 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:02:32,588 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:02:32,589 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:02:32,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:02:32,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:02:32,589 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:02:32,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:02:32,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:02:32,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:02:32,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:02:32,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:02:32,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:02:32,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:02:32,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:02:32,591 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:02:32,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:02:32,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:02:32,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:02:32,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:02:32,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:02:32,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:02:32,593 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 12:02:32,594 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:02:32,594 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-22 12:02:33,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:02:33,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:02:33,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:02:33,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:02:33,053 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:02:33,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-07-22 12:02:33,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e00b2552/bd6e11393c1f4b2280bb975b40867e52/FLAG383e7e286 [2022-07-22 12:02:33,880 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:02:33,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-07-22 12:02:33,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e00b2552/bd6e11393c1f4b2280bb975b40867e52/FLAG383e7e286 [2022-07-22 12:02:34,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e00b2552/bd6e11393c1f4b2280bb975b40867e52 [2022-07-22 12:02:34,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:02:34,256 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:02:34,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:02:34,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:02:34,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:02:34,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f5a7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34, skipping insertion in model container [2022-07-22 12:02:34,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:02:34,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:02:34,650 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/unroll-cond-5.wvr.c[2975,2988] [2022-07-22 12:02:34,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:02:34,686 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:02:34,738 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/unroll-cond-5.wvr.c[2975,2988] [2022-07-22 12:02:34,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:02:34,760 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:02:34,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34 WrapperNode [2022-07-22 12:02:34,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:02:34,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:02:34,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:02:34,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:02:34,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,818 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 202 [2022-07-22 12:02:34,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:02:34,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:02:34,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:02:34,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:02:34,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:02:34,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:02:34,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:02:34,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:02:34,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (1/1) ... [2022-07-22 12:02:34,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:34,901 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-22 12:02:34,926 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-22 12:02:34,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:02:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:02:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:02:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:02:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:02:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:02:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:02:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:02:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:02:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:02:34,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:02:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:02:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:02:34,969 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:02:35,075 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:02:35,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:02:35,662 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:02:35,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:02:35,677 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:02:35,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:35 BoogieIcfgContainer [2022-07-22 12:02:35,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:02:35,682 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:02:35,682 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:02:35,687 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:02:35,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:35,689 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:02:34" (1/3) ... [2022-07-22 12:02:35,690 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9231f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:35, skipping insertion in model container [2022-07-22 12:02:35,690 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:35,690 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:34" (2/3) ... [2022-07-22 12:02:35,691 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9231f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:35, skipping insertion in model container [2022-07-22 12:02:35,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:35,691 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:35" (3/3) ... [2022-07-22 12:02:35,693 INFO L322 chiAutomizerObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2022-07-22 12:02:35,899 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:02:35,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 249 places, 268 transitions, 552 flow [2022-07-22 12:02:36,094 INFO L129 PetriNetUnfolder]: 24/264 cut-off events. [2022-07-22 12:02:36,094 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:02:36,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 264 events. 24/264 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 502 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 171. Up to 2 conditions per place. [2022-07-22 12:02:36,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 268 transitions, 552 flow [2022-07-22 12:02:36,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 264 transitions, 540 flow [2022-07-22 12:02:36,136 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:02:36,136 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:02:36,137 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:02:36,137 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:02:36,137 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:02:36,137 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:02:36,137 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:02:36,137 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:02:36,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:02:37,064 INFO L131 ngComponentsAnalysis]: Automaton has 270 accepting balls. 8400 [2022-07-22 12:02:37,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:37,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:37,073 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:37,073 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:02:37,073 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:02:37,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 9643 states, but on-demand construction may add more states [2022-07-22 12:02:37,259 INFO L131 ngComponentsAnalysis]: Automaton has 270 accepting balls. 8400 [2022-07-22 12:02:37,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:37,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:37,267 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:37,267 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:02:37,284 INFO L748 eck$LassoCheckResult]: Stem: 252#[ULTIMATE.startENTRY]don't care [613] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 255#[L-1]don't care [535] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 257#[L-1-1]don't care [619] L-1-1-->L-1-2: Formula: (= (select |v_#valid_22| 0) 0) InVars {#valid=|v_#valid_22|} OutVars{#valid=|v_#valid_22|} AuxVars[] AssignedVars[] 259#[L-1-2]don't care [622] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 261#[L21]don't care [450] L21-->L21-1: Formula: (and (= (select |v_#valid_23| 1) 1) (= 2 (select |v_#length_18| 1))) InVars {#length=|v_#length_18|, #valid=|v_#valid_23|} OutVars{#length=|v_#length_18|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[] 263#[L21-1]don't care [609] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_19| 1) 0) 48) InVars {#memory_int=|v_#memory_int_19|} OutVars{#memory_int=|v_#memory_int_19|} AuxVars[] AssignedVars[] 265#[L21-2]don't care [543] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_20| 1) 1) 0) InVars {#memory_int=|v_#memory_int_20|} OutVars{#memory_int=|v_#memory_int_20|} AuxVars[] AssignedVars[] 267#[L21-3]don't care [585] L21-3-->L21-4: Formula: (and (= (select |v_#valid_24| 2) 1) (= (select |v_#length_19| 2) 20)) InVars {#length=|v_#length_19|, #valid=|v_#valid_24|} OutVars{#length=|v_#length_19|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[] 269#[L21-4]don't care [426] L21-4-->L42: Formula: (and (= v_~f~0.offset_12 0) (= v_~f~0.base_12 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_12, ~f~0.offset=v_~f~0.offset_12} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 271#[L42]don't care [418] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 273#[L42-1]don't care [610] L42-1-->L42-2: Formula: (= v_~x2~0_29 0) InVars {} OutVars{~x2~0=v_~x2~0_29} AuxVars[] AssignedVars[~x2~0] 275#[L42-2]don't care [561] L42-2-->L43: Formula: (= v_~size~0_14 0) InVars {} OutVars{~size~0=v_~size~0_14} AuxVars[] AssignedVars[~size~0] 277#[L43]don't care [615] L43-->L-1-3: Formula: (= v_~n~0_13 0) InVars {} OutVars{~n~0=v_~n~0_13} AuxVars[] AssignedVars[~n~0] 279#[L-1-3]don't care [627] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 281#[L-1-4]don't care [407] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 283#[L-1-5]don't care [515] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 285#[L-1-6]don't care [604] L-1-6-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_4|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_1|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_4|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_2|, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_3|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret23#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre24#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_#t~mem29#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~ret23#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base] 287#[L100]don't care [553] L100-->L100-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= |v_#length_20| (store |v_#length_21| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_21|, #valid=|v_#valid_26|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_20|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 289#[L100-1]don't care [574] L100-1-->L100-2: Formula: (and (= |v_#length_22| (store |v_#length_23| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_27|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_23|, #valid=|v_#valid_28|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 291#[L100-2]don't care [455] L100-2-->L103: Formula: (= v_~n~0_14 |v_ULTIMATE.start_main_#t~nondet21#1_2|) InVars {ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|} OutVars{ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|, ~n~0=v_~n~0_14} AuxVars[] AssignedVars[~n~0] 293#[L103]don't care [611] L103-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21#1] 295#[L104]don't care [384] L104-->L104-1: Formula: (= v_~size~0_11 |v_ULTIMATE.start_main_#t~nondet22#1_1|) InVars {ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|} OutVars{~size~0=v_~size~0_11, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|} AuxVars[] AssignedVars[~size~0] 297#[L104-1]don't care [628] L104-1-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1] 299#[L105]don't care [518] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 301#[L105-1]don't care [557] L105-1-->L105-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~size~0_12) 1 0)) InVars {~size~0=v_~size~0_12} OutVars{~size~0=v_~size~0_12, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 303#[L105-2]don't care [405] L105-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 305#[L37]don't care [419] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 307#[L38]don't care [563] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 311#[L37-1]don't care [556] L37-1-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 313#[L106]don't care [479] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 315#[L106-1]don't care [473] L106-1-->L106-2: Formula: (= v_~size~0_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_13} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_13} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 317#[L106-2]don't care [413] L106-2-->L106-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 319#[L106-3]don't care [370] L106-3-->L120: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post31#1, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 321#[L120]don't care [542] L120-->L121: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 323#[L121]don't care [390] L121-->L121-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 325#[L121-1]don't care [458] L121-1-->L121-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 327#[L121-2]don't care [510] L121-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 329#[L37-2]don't care [519] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 331#[L38-3]don't care [401] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 335#[L37-3]don't care [394] L37-3-->L122: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 337#[L122]don't care [544] L122-->L122-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 339#[L122-1]don't care [406] L122-1-->L122-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 341#[L122-2]don't care [597] L122-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 343#[L37-4]don't care [601] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 345#[L38-6]don't care [448] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 347#[L37-5]don't care [437] L37-5-->L124: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 351#[L124]don't care [582] L124-->L124-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| 1) |v_#valid_11|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| |v_#StackHeapBarrier_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4))) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_12|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2|, #valid=|v_#valid_11|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset] 353#[L124-1]don't care [402] L124-1-->L124-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 355#[L124-2]don't care [423] L124-2-->L125: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset] 357#[L125]don't care [587] L125-->L125-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 359#[L125-6]don't care [2022-07-22 12:02:37,285 INFO L750 eck$LassoCheckResult]: Loop: 359#[L125-6]don't care [454] L125-6-->L126: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 363#[L126]don't care [569] L126-->L126-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_2|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_2|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_2|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] 367#[L126-1]don't care [547] L126-1-->L125-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet32#1] 371#[L125-3]don't care [525] L125-3-->L125-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post31#1] 375#[L125-4]don't care [477] L125-4-->L125-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 379#[L125-5]don't care [377] L125-5-->L125-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post31#1] 359#[L125-6]don't care [2022-07-22 12:02:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -269174653, now seen corresponding path program 1 times [2022-07-22 12:02:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:37,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616617388] [2022-07-22 12:02:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1542535162, now seen corresponding path program 1 times [2022-07-22 12:02:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:37,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543411011] [2022-07-22 12:02:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash -597293316, now seen corresponding path program 1 times [2022-07-22 12:02:37,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:37,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369308912] [2022-07-22 12:02:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:37,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:38,864 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:38,865 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:38,865 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:38,865 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:38,865 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:38,865 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:38,865 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:38,866 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:38,866 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-5.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:02:38,866 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:38,866 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:38,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:38,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:39,830 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:02:39,835 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:02:39,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:39,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:39,839 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-22 12:02:39,843 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-22 12:02:39,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:39,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:39,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:39,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:39,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:39,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:39,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:39,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:39,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:39,917 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-22 12:02:39,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:39,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:39,920 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-22 12:02:39,922 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-22 12:02:39,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:39,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:39,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:39,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:39,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:39,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:39,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:39,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:39,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:39,963 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-22 12:02:39,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:39,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:39,966 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-22 12:02:39,972 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-22 12:02:39,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:39,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:39,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:39,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:39,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:39,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:39,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:39,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:40,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,032 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-22 12:02:40,033 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-22 12:02:40,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:40,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:40,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:40,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,088 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-22 12:02:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,091 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-22 12:02:40,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-22 12:02:40,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,127 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-22 12:02:40,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,178 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-22 12:02:40,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,182 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-22 12:02:40,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:40,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:40,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:40,198 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-22 12:02:40,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:40,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,236 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-22 12:02:40,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,263 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-22 12:02:40,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-22 12:02:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,302 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-22 12:02:40,303 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-22 12:02:40,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:40,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:40,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:40,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:40,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,343 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-22 12:02:40,349 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-22 12:02:40,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:40,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:40,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:40,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:40,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,399 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-22 12:02:40,400 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-22 12:02:40,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,450 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-22 12:02:40,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,451 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-22 12:02:40,452 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-22 12:02:40,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:40,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,500 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-22 12:02:40,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,502 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-22 12:02:40,503 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-22 12:02:40,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:40,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,573 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-22 12:02:40,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,575 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-22 12:02:40,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:40,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:40,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:40,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:40,592 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-22 12:02:40,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:40,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,638 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-22 12:02:40,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,643 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-22 12:02:40,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:40,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:40,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:40,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,695 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-22 12:02:40,698 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-22 12:02:40,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:40,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,738 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-22 12:02:40,739 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-22 12:02:40,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:40,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,781 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-22 12:02:40,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,782 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-22 12:02:40,783 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-22 12:02:40,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,859 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-22 12:02:40,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,861 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-22 12:02:40,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:40,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:40,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,881 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-22 12:02:40,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:40,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:40,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-22 12:02:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,911 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-22 12:02:40,915 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-22 12:02:40,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-22 12:02:40,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:40,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:40,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:40,967 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-22 12:02:40,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:40,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:40,968 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-22 12:02:40,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-22 12:02:40,973 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-22 12:02:40,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:40,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:40,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:40,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:40,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:40,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:40,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:40,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,005 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-22 12:02:41,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,007 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-22 12:02:41,008 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-22 12:02:41,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-22 12:02:41,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:41,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:41,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:41,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:41,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,042 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-22 12:02:41,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-22 12:02:41,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,061 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-22 12:02:41,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,092 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-22 12:02:41,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,093 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-22 12:02:41,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,096 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-22 12:02:41,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,149 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-22 12:02:41,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,151 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-22 12:02:41,151 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-22 12:02:41,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 12:02:41,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,190 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-22 12:02:41,192 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-22 12:02:41,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 12:02:41,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,241 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-22 12:02:41,264 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-22 12:02:41,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,300 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-22 12:02:41,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,301 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-22 12:02:41,302 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-22 12:02:41,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:02:41,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,339 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-22 12:02:41,340 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-22 12:02:41,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:41,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,350 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:02:41,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,354 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:02:41,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,413 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-22 12:02:41,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,414 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-22 12:02:41,415 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-22 12:02:41,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 12:02:41,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,464 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-22 12:02:41,465 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-22 12:02:41,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,500 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-22 12:02:41,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,501 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-22 12:02:41,503 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-22 12:02:41,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:41,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:41,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:41,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:41,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,538 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-22 12:02:41,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,540 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-22 12:02:41,542 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-22 12:02:41,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:41,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,594 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-22 12:02:41,603 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-22 12:02:41,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-22 12:02:41,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:41,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,662 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-22 12:02:41,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,681 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-22 12:02:41,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:41,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,724 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-22 12:02:41,725 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-22 12:02:41,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,775 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-22 12:02:41,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,776 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-22 12:02:41,778 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-22 12:02:41,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:41,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:41,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,814 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-22 12:02:41,815 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-22 12:02:41,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:02:41,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:41,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:41,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:41,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:41,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:41,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:41,855 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:02:41,900 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-22 12:02:41,901 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:02:41,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:41,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:41,905 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-22 12:02:41,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:02:41,922 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-22 12:02:41,933 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:02:41,934 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:02:41,934 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:02:41,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:42,017 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:02:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:42,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:02:42,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:42,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:02:42,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:42,280 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-22 12:02:42,322 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 12:02:42,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 9643 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:42,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:42,820 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 9643 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19273 states and 56152 transitions. Complement of second has 8 states. [2022-07-22 12:02:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:02:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2022-07-22 12:02:42,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 296 transitions. Stem has 50 letters. Loop has 6 letters. [2022-07-22 12:02:42,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:42,839 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:02:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:42,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:02:42,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:42,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:02:42,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:43,024 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-22 12:02:43,025 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 12:02:43,025 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 9643 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:43,396 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 9643 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19267 states and 56145 transitions. Complement of second has 10 states. [2022-07-22 12:02:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 12:02:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2022-07-22 12:02:43,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 297 transitions. Stem has 50 letters. Loop has 6 letters. [2022-07-22 12:02:43,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:43,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 297 transitions. Stem has 56 letters. Loop has 6 letters. [2022-07-22 12:02:43,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:43,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 297 transitions. Stem has 50 letters. Loop has 12 letters. [2022-07-22 12:02:43,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:43,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19267 states and 56145 transitions. [2022-07-22 12:02:43,723 INFO L131 ngComponentsAnalysis]: Automaton has 269 accepting balls. 8394 [2022-07-22 12:02:43,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19267 states to 8739 states and 25386 transitions. [2022-07-22 12:02:43,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8732 [2022-07-22 12:02:43,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8733 [2022-07-22 12:02:43,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8739 states and 25386 transitions. [2022-07-22 12:02:44,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:44,029 INFO L220 hiAutomatonCegarLoop]: Abstraction has 8739 states and 25386 transitions. [2022-07-22 12:02:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8739 states and 25386 transitions. [2022-07-22 12:02:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8739 to 8739. [2022-07-22 12:02:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8739 states, 8739 states have (on average 2.9049090284929626) internal successors, (25386), 8738 states have internal predecessors, (25386), 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-22 12:02:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8739 states to 8739 states and 25386 transitions. [2022-07-22 12:02:44,492 INFO L242 hiAutomatonCegarLoop]: Abstraction has 8739 states and 25386 transitions. [2022-07-22 12:02:44,492 INFO L425 stractBuchiCegarLoop]: Abstraction has 8739 states and 25386 transitions. [2022-07-22 12:02:44,493 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:02:44,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8739 states and 25386 transitions. [2022-07-22 12:02:44,567 INFO L131 ngComponentsAnalysis]: Automaton has 269 accepting balls. 8394 [2022-07-22 12:02:44,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:44,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:44,569 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:44,569 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:44,571 INFO L748 eck$LassoCheckResult]: Stem: 75940#[ULTIMATE.startENTRY]don't care [613] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 74560#[L-1]don't care [535] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 62506#[L-1-1]don't care [619] L-1-1-->L-1-2: Formula: (= (select |v_#valid_22| 0) 0) InVars {#valid=|v_#valid_22|} OutVars{#valid=|v_#valid_22|} AuxVars[] AssignedVars[] 62508#[L-1-2]don't care [622] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 69780#[L21]don't care [450] L21-->L21-1: Formula: (and (= (select |v_#valid_23| 1) 1) (= 2 (select |v_#length_18| 1))) InVars {#length=|v_#length_18|, #valid=|v_#valid_23|} OutVars{#length=|v_#length_18|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[] 69782#[L21-1]don't care [609] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_19| 1) 0) 48) InVars {#memory_int=|v_#memory_int_19|} OutVars{#memory_int=|v_#memory_int_19|} AuxVars[] AssignedVars[] 74826#[L21-2]don't care [543] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_20| 1) 1) 0) InVars {#memory_int=|v_#memory_int_20|} OutVars{#memory_int=|v_#memory_int_20|} AuxVars[] AssignedVars[] 74828#[L21-3]don't care [585] L21-3-->L21-4: Formula: (and (= (select |v_#valid_24| 2) 1) (= (select |v_#length_19| 2) 20)) InVars {#length=|v_#length_19|, #valid=|v_#valid_24|} OutVars{#length=|v_#length_19|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[] 68546#[L21-4]don't care [426] L21-4-->L42: Formula: (and (= v_~f~0.offset_12 0) (= v_~f~0.base_12 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_12, ~f~0.offset=v_~f~0.offset_12} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 67398#[L42]don't care [418] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 67400#[L42-1]don't care [610] L42-1-->L42-2: Formula: (= v_~x2~0_29 0) InVars {} OutVars{~x2~0=v_~x2~0_29} AuxVars[] AssignedVars[~x2~0] 70324#[L42-2]don't care [561] L42-2-->L43: Formula: (= v_~size~0_14 0) InVars {} OutVars{~size~0=v_~size~0_14} AuxVars[] AssignedVars[~size~0] 65746#[L43]don't care [615] L43-->L-1-3: Formula: (= v_~n~0_13 0) InVars {} OutVars{~n~0=v_~n~0_13} AuxVars[] AssignedVars[~n~0] 64090#[L-1-3]don't care [627] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 64092#[L-1-4]don't care [407] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 70530#[L-1-5]don't care [515] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 71114#[L-1-6]don't care [604] L-1-6-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_4|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_1|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_4|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_2|, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_3|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret23#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre24#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_#t~mem29#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~ret23#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base] 71116#[L100]don't care [553] L100-->L100-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= |v_#length_20| (store |v_#length_21| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_21|, #valid=|v_#valid_26|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_20|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 75088#[L100-1]don't care [574] L100-1-->L100-2: Formula: (and (= |v_#length_22| (store |v_#length_23| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_27|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_23|, #valid=|v_#valid_28|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 75090#[L100-2]don't care [455] L100-2-->L103: Formula: (= v_~n~0_14 |v_ULTIMATE.start_main_#t~nondet21#1_2|) InVars {ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|} OutVars{ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|, ~n~0=v_~n~0_14} AuxVars[] AssignedVars[~n~0] 75614#[L103]don't care [611] L103-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21#1] 69466#[L104]don't care [384] L104-->L104-1: Formula: (= v_~size~0_11 |v_ULTIMATE.start_main_#t~nondet22#1_1|) InVars {ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|} OutVars{~size~0=v_~size~0_11, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|} AuxVars[] AssignedVars[~size~0] 69468#[L104-1]don't care [628] L104-1-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1] 71198#[L105]don't care [518] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 74534#[L105-1]don't care [557] L105-1-->L105-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~size~0_12) 1 0)) InVars {~size~0=v_~size~0_12} OutVars{~size~0=v_~size~0_12, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 74592#[L105-2]don't care [405] L105-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 75168#[L37]don't care [419] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 62114#[L38]don't care [563] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 62116#[L37-1]don't care [556] L37-1-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 67914#[L106]don't care [479] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 74502#[L106-1]don't care [473] L106-1-->L106-2: Formula: (= v_~size~0_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_13} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_13} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 75588#[L106-2]don't care [413] L106-2-->L106-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 75590#[L106-3]don't care [370] L106-3-->L120: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post31#1, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 70064#[L120]don't care [542] L120-->L121: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 70066#[L121]don't care [390] L121-->L121-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 67562#[L121-1]don't care [458] L121-1-->L121-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 67564#[L121-2]don't care [510] L121-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 75020#[L37-2]don't care [519] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 75038#[L38-3]don't care [401] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 73524#[L37-3]don't care [394] L37-3-->L122: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 73526#[L122]don't care [544] L122-->L122-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 74392#[L122-1]don't care [406] L122-1-->L122-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 74394#[L122-2]don't care [597] L122-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 73950#[L37-4]don't care [601] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 71458#[L38-6]don't care [448] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 70634#[L37-5]don't care [437] L37-5-->L124: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 70636#[L124]don't care [582] L124-->L124-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| 1) |v_#valid_11|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| |v_#StackHeapBarrier_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4))) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_12|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2|, #valid=|v_#valid_11|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset] 72880#[L124-1]don't care [402] L124-1-->L124-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 74426#[L124-2]don't care [423] L124-2-->L125: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset] 74428#[L125]don't care [587] L125-->L125-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 75546#[L125-6]don't care [453] L125-6-->L125-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 75990#[L125-7]don't care [491] L125-7-->L128: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 74244#[L128]don't care [549] L128-->L106-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret23#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_main_#t~ret23#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret23#1.offset, ULTIMATE.start_main_#t~ret23#1.base] 61624#[L106-4]don't care [501] L106-4-->L106-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 61626#[L106-5]don't care [513] L106-5-->L106-6: Formula: (and (= v_~f~0.base_11 |v_ULTIMATE.start_main_#t~ret23#1.base_2|) (= v_~f~0.offset_11 |v_ULTIMATE.start_main_#t~ret23#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_2|, ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_2|} OutVars{ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_2|, ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_2|, ~f~0.base=v_~f~0.base_11, ~f~0.offset=v_~f~0.offset_11} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 75242#[L106-6]don't care [410] L106-6-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_3|, ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret23#1.offset, ULTIMATE.start_main_#t~ret23#1.base] 73700#[L109]don't care [469] L109-->L109-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre24#1_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre24#1] 73702#[L109-1]don't care [482] L109-1-->L109-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 75388#[L109-2]don't care [492] L109-2-->L109-3: Formula: (and (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre24#1_2|)) |v_#memory_int_13|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_13|, #length=|v_#length_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 72686#[L109-3]don't care [792] L109-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre24#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 69314#[thread1ENTRY, L109-4]don't care [630] thread1ENTRY-->L49-2: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 61654#[L109-4, L49-2]don't care [2022-07-22 12:02:44,572 INFO L750 eck$LassoCheckResult]: Loop: 61654#[L109-4, L49-2]don't care [633] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_5| 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} OutVars{~n~0=v_~n~0_2, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} AuxVars[] AssignedVars[] 61658#[L50, L109-4]don't care [635] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 67480#[L50-1, L109-4]don't care [637] L50-1-->L50-2: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~x1~0_1 v_~size~0_1) (<= 0 v_~x1~0_1)) 1 0)) InVars {~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] 67484#[L50-2, L109-4]don't care [638] L50-2-->L37: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] 75972#[L37, L109-4]don't care [639] L37-->L38: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] 75696#[L38, L109-4]don't care [641] L38-->L37-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 75700#[L37-1, L109-4]don't care [643] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 75846#[L109-4, L51]don't care [644] L51-->L51-1: Formula: (let ((.cse1 (* v_~x1~0_2 4))) (let ((.cse0 (+ .cse1 v_~f~0.offset_1))) (and (= (select (select |v_#memory_int_1| v_~f~0.base_1) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) (= (select |v_#valid_1| v_~f~0.base_1) 1) (<= 0 .cse0) (<= (+ .cse1 v_~f~0.offset_1 4) (select |v_#length_1| v_~f~0.base_1))))) InVars {~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} OutVars{~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 75276#[L51-1, L109-4]don't care [645] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 67042#[L51-2, L109-4]don't care [646] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 67044#[L109-4, L52]don't care [647] L52-->L52-1: Formula: (= |v_thread1Thread1of1ForFork0_#t~post2#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_7|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 75792#[L52-1, L109-4]don't care [648] L52-1-->L52-2: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post2#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_9|) InVars {thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 75868#[L109-4, L52-2]don't care [649] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 61654#[L109-4, L49-2]don't care [2022-07-22 12:02:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:44,572 INFO L85 PathProgramCache]: Analyzing trace with hash 167672459, now seen corresponding path program 1 times [2022-07-22 12:02:44,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:44,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565852756] [2022-07-22 12:02:44,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:44,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:44,738 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-22 12:02:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:02:44,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565852756] [2022-07-22 12:02:44,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565852756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:02:44,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:02:44,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 12:02:44,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691754202] [2022-07-22 12:02:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:02:44,743 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:02:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2061392288, now seen corresponding path program 1 times [2022-07-22 12:02:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:44,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054609467] [2022-07-22 12:02:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:44,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:44,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:44,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:02:44,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 12:02:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 12:02:44,899 INFO L87 Difference]: Start difference. First operand 8739 states and 25386 transitions. cyclomatic complexity: 16917 Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:02:45,219 INFO L93 Difference]: Finished difference Result 8743 states and 23930 transitions. [2022-07-22 12:02:45,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8743 states and 23930 transitions. [2022-07-22 12:02:45,327 INFO L131 ngComponentsAnalysis]: Automaton has 293 accepting balls. 8033 [2022-07-22 12:02:45,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8743 states to 8412 states and 23015 transitions. [2022-07-22 12:02:45,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8402 [2022-07-22 12:02:45,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8402 [2022-07-22 12:02:45,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8412 states and 23015 transitions. [2022-07-22 12:02:45,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:45,475 INFO L220 hiAutomatonCegarLoop]: Abstraction has 8412 states and 23015 transitions. [2022-07-22 12:02:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8412 states and 23015 transitions. [2022-07-22 12:02:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8412 to 8408. [2022-07-22 12:02:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8408 states, 8408 states have (on average 2.7367982873453855) internal successors, (23011), 8407 states have internal predecessors, (23011), 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-22 12:02:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8408 states to 8408 states and 23011 transitions. [2022-07-22 12:02:45,895 INFO L242 hiAutomatonCegarLoop]: Abstraction has 8408 states and 23011 transitions. [2022-07-22 12:02:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 12:02:45,897 INFO L425 stractBuchiCegarLoop]: Abstraction has 8408 states and 23011 transitions. [2022-07-22 12:02:45,897 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:02:45,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8408 states and 23011 transitions. [2022-07-22 12:02:45,964 INFO L131 ngComponentsAnalysis]: Automaton has 293 accepting balls. 8033 [2022-07-22 12:02:45,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:45,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:45,966 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:45,966 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:45,968 INFO L748 eck$LassoCheckResult]: Stem: 101520#[ULTIMATE.startENTRY]don't care [613] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 100128#[L-1]don't care [535] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 88530#[L-1-1]don't care [619] L-1-1-->L-1-2: Formula: (= (select |v_#valid_22| 0) 0) InVars {#valid=|v_#valid_22|} OutVars{#valid=|v_#valid_22|} AuxVars[] AssignedVars[] 88532#[L-1-2]don't care [622] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 95438#[L21]don't care [450] L21-->L21-1: Formula: (and (= (select |v_#valid_23| 1) 1) (= 2 (select |v_#length_18| 1))) InVars {#length=|v_#length_18|, #valid=|v_#valid_23|} OutVars{#length=|v_#length_18|, #valid=|v_#valid_23|} AuxVars[] AssignedVars[] 95440#[L21-1]don't care [609] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_19| 1) 0) 48) InVars {#memory_int=|v_#memory_int_19|} OutVars{#memory_int=|v_#memory_int_19|} AuxVars[] AssignedVars[] 100394#[L21-2]don't care [543] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_20| 1) 1) 0) InVars {#memory_int=|v_#memory_int_20|} OutVars{#memory_int=|v_#memory_int_20|} AuxVars[] AssignedVars[] 100396#[L21-3]don't care [585] L21-3-->L21-4: Formula: (and (= (select |v_#valid_24| 2) 1) (= (select |v_#length_19| 2) 20)) InVars {#length=|v_#length_19|, #valid=|v_#valid_24|} OutVars{#length=|v_#length_19|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[] 94256#[L21-4]don't care [426] L21-4-->L42: Formula: (and (= v_~f~0.offset_12 0) (= v_~f~0.base_12 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_12, ~f~0.offset=v_~f~0.offset_12} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 93180#[L42]don't care [418] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 93182#[L42-1]don't care [610] L42-1-->L42-2: Formula: (= v_~x2~0_29 0) InVars {} OutVars{~x2~0=v_~x2~0_29} AuxVars[] AssignedVars[~x2~0] 95954#[L42-2]don't care [561] L42-2-->L43: Formula: (= v_~size~0_14 0) InVars {} OutVars{~size~0=v_~size~0_14} AuxVars[] AssignedVars[~size~0] 91588#[L43]don't care [615] L43-->L-1-3: Formula: (= v_~n~0_13 0) InVars {} OutVars{~n~0=v_~n~0_13} AuxVars[] AssignedVars[~n~0] 90064#[L-1-3]don't care [627] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 90066#[L-1-4]don't care [407] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 96154#[L-1-5]don't care [515] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 96732#[L-1-6]don't care [604] L-1-6-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_4|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_1|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_4|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_2|, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_3|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret23#1.offset, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre24#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_#t~mem29#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~ret23#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base] 96734#[L100]don't care [553] L100-->L100-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= |v_#length_20| (store |v_#length_21| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_21|, #valid=|v_#valid_26|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_20|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_25|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 100652#[L100-1]don't care [574] L100-1-->L100-2: Formula: (and (= |v_#length_22| (store |v_#length_23| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_27|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_23|, #valid=|v_#valid_28|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 100654#[L100-2]don't care [455] L100-2-->L103: Formula: (= v_~n~0_14 |v_ULTIMATE.start_main_#t~nondet21#1_2|) InVars {ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|} OutVars{ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_2|, ~n~0=v_~n~0_14} AuxVars[] AssignedVars[~n~0] 101190#[L103]don't care [611] L103-->L104: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21#1] 95136#[L104]don't care [384] L104-->L104-1: Formula: (= v_~size~0_11 |v_ULTIMATE.start_main_#t~nondet22#1_1|) InVars {ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|} OutVars{~size~0=v_~size~0_11, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_1|} AuxVars[] AssignedVars[~size~0] 95138#[L104-1]don't care [628] L104-1-->L105: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1] 96812#[L105]don't care [518] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 100102#[L105-1]don't care [557] L105-1-->L105-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~size~0_12) 1 0)) InVars {~size~0=v_~size~0_12} OutVars{~size~0=v_~size~0_12, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 100158#[L105-2]don't care [405] L105-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 100732#[L37]don't care [419] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 88160#[L38]don't care [563] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 88162#[L37-1]don't care [556] L37-1-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 93660#[L106]don't care [479] L106-->L106-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 100070#[L106-1]don't care [473] L106-1-->L106-2: Formula: (= v_~size~0_13 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_13} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_13} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 101160#[L106-2]don't care [413] L106-2-->L106-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 101162#[L106-3]don't care [370] L106-3-->L120: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post31#1, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 95716#[L120]don't care [542] L120-->L121: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 95718#[L121]don't care [390] L121-->L121-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 93334#[L121-1]don't care [458] L121-1-->L121-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 93336#[L121-2]don't care [510] L121-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 100586#[L37-2]don't care [519] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 100604#[L38-3]don't care [401] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 99114#[L37-3]don't care [394] L37-3-->L122: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 99116#[L122]don't care [544] L122-->L122-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 99960#[L122-1]don't care [406] L122-1-->L122-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 99962#[L122-2]don't care [597] L122-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 99530#[L37-4]don't care [601] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 97060#[L38-6]don't care [448] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 96256#[L37-5]don't care [437] L37-5-->L124: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 96258#[L124]don't care [582] L124-->L124-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| 1) |v_#valid_11|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| |v_#StackHeapBarrier_1|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4))) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_12|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_2|, #valid=|v_#valid_11|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset] 98470#[L124-1]don't care [402] L124-1-->L124-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 99994#[L124-2]don't care [423] L124-2-->L125: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc30#1.offset] 99996#[L125]don't care [587] L125-->L125-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 101118#[L125-6]don't care [454] L125-6-->L126: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 100420#[L126]don't care [569] L126-->L126-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_2|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_2|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_2|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] 99418#[L126-1]don't care [547] L126-1-->L125-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet32#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet32#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet32#1] 87846#[L125-3]don't care [525] L125-3-->L125-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post31#1] 87848#[L125-4]don't care [477] L125-4-->L125-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 98248#[L125-5]don't care [377] L125-5-->L125-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post31#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post31#1] 101568#[L125-6]don't care [453] L125-6-->L125-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 101570#[L125-7]don't care [491] L125-7-->L128: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 99820#[L128]don't care [549] L128-->L106-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret23#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_main_#t~ret23#1.offset_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret23#1.offset, ULTIMATE.start_main_#t~ret23#1.base] 87700#[L106-4]don't care [501] L106-4-->L106-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 87702#[L106-5]don't care [513] L106-5-->L106-6: Formula: (and (= v_~f~0.base_11 |v_ULTIMATE.start_main_#t~ret23#1.base_2|) (= v_~f~0.offset_11 |v_ULTIMATE.start_main_#t~ret23#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_2|, ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_2|} OutVars{ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_2|, ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_2|, ~f~0.base=v_~f~0.base_11, ~f~0.offset=v_~f~0.offset_11} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 100810#[L106-6]don't care [410] L106-6-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret23#1.base=|v_ULTIMATE.start_main_#t~ret23#1.base_3|, ULTIMATE.start_main_#t~ret23#1.offset=|v_ULTIMATE.start_main_#t~ret23#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret23#1.offset, ULTIMATE.start_main_#t~ret23#1.base] 99292#[L109]don't care [469] L109-->L109-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre24#1_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre24#1] 99294#[L109-1]don't care [482] L109-1-->L109-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 100952#[L109-2]don't care [492] L109-2-->L109-3: Formula: (and (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre24#1_2|)) |v_#memory_int_13|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_13|, #length=|v_#length_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 98282#[L109-3]don't care [792] L109-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre24#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 94992#[thread1ENTRY, L109-4]don't care [630] thread1ENTRY-->L49-2: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 87724#[L109-4, L49-2]don't care [2022-07-22 12:02:45,968 INFO L750 eck$LassoCheckResult]: Loop: 87724#[L109-4, L49-2]don't care [633] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_5| 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} OutVars{~n~0=v_~n~0_2, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} AuxVars[] AssignedVars[] 87728#[L50, L109-4]don't care [635] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 93260#[L50-1, L109-4]don't care [637] L50-1-->L50-2: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~x1~0_1 v_~size~0_1) (<= 0 v_~x1~0_1)) 1 0)) InVars {~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~size~0=v_~size~0_1, ~x1~0=v_~x1~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] 93264#[L50-2, L109-4]don't care [638] L50-2-->L37: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] 101550#[L37, L109-4]don't care [639] L37-->L38: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] 101266#[L38, L109-4]don't care [641] L38-->L37-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 101270#[L37-1, L109-4]don't care [643] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 101418#[L109-4, L51]don't care [644] L51-->L51-1: Formula: (let ((.cse1 (* v_~x1~0_2 4))) (let ((.cse0 (+ .cse1 v_~f~0.offset_1))) (and (= (select (select |v_#memory_int_1| v_~f~0.base_1) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) (= (select |v_#valid_1| v_~f~0.base_1) 1) (<= 0 .cse0) (<= (+ .cse1 v_~f~0.offset_1 4) (select |v_#length_1| v_~f~0.base_1))))) InVars {~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} OutVars{~f~0.base=v_~f~0.base_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 100844#[L51-1, L109-4]don't care [645] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 92820#[L51-2, L109-4]don't care [646] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 92822#[L109-4, L52]don't care [647] L52-->L52-1: Formula: (= |v_thread1Thread1of1ForFork0_#t~post2#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_7|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 101366#[L52-1, L109-4]don't care [648] L52-1-->L52-2: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post2#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_9|) InVars {thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 101444#[L109-4, L52-2]don't care [649] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 87724#[L109-4, L49-2]don't care [2022-07-22 12:02:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1615304306, now seen corresponding path program 1 times [2022-07-22 12:02:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:45,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773849151] [2022-07-22 12:02:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:46,001 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:46,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2061392288, now seen corresponding path program 2 times [2022-07-22 12:02:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:46,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145236931] [2022-07-22 12:02:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:46,045 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:46,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:46,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1220292721, now seen corresponding path program 1 times [2022-07-22 12:02:46,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:46,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833738145] [2022-07-22 12:02:46,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:46,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:46,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:47,908 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:47,909 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:47,909 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:47,909 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:47,909 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:47,909 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:47,909 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:47,909 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:47,909 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-5.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:02:47,909 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:47,909 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:47,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:47,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:02:48,126 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) 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-22 12:02:48,131 INFO L158 Benchmark]: Toolchain (without parser) took 13878.13ms. Allocated memory was 151.0MB in the beginning and 413.1MB in the end (delta: 262.1MB). Free memory was 125.1MB in the beginning and 148.4MB in the end (delta: -23.3MB). Peak memory consumption was 254.6MB. Max. memory is 8.0GB. [2022-07-22 12:02:48,131 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:02:48,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.10ms. Allocated memory is still 151.0MB. Free memory was 124.9MB in the beginning and 113.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:02:48,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.35ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 111.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:48,133 INFO L158 Benchmark]: Boogie Preprocessor took 37.00ms. Allocated memory is still 151.0MB. Free memory was 111.2MB in the beginning and 109.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:48,133 INFO L158 Benchmark]: RCFGBuilder took 823.45ms. Allocated memory is still 151.0MB. Free memory was 109.5MB in the beginning and 124.8MB in the end (delta: -15.3MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-07-22 12:02:48,134 INFO L158 Benchmark]: BuchiAutomizer took 12447.14ms. Allocated memory was 151.0MB in the beginning and 413.1MB in the end (delta: 262.1MB). Free memory was 124.8MB in the beginning and 148.4MB in the end (delta: -23.6MB). Peak memory consumption was 254.8MB. Max. memory is 8.0GB. [2022-07-22 12:02:48,137 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.26ms. Allocated memory is still 151.0MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.10ms. Allocated memory is still 151.0MB. Free memory was 124.9MB in the beginning and 113.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.35ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 111.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.00ms. Allocated memory is still 151.0MB. Free memory was 111.2MB in the beginning and 109.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 823.45ms. Allocated memory is still 151.0MB. Free memory was 109.5MB in the beginning and 124.8MB in the end (delta: -15.3MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 12447.14ms. Allocated memory was 151.0MB in the beginning and 413.1MB in the end (delta: 262.1MB). Free memory was 124.8MB in the beginning and 148.4MB in the end (delta: -23.6MB). Peak memory consumption was 254.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:02:48,185 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...