/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-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:02:19,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:02:19,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:02:19,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:02:19,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:02:19,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:02:19,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:02:19,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:02:19,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:02:19,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:02:19,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:02:19,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:02:19,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:02:19,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:02:19,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:02:19,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:02:19,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:02:19,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:02:19,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:02:19,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:02:19,321 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:02:19,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:02:19,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:02:19,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:02:19,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:02:19,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:02:19,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:02:19,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:02:19,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:02:19,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:02:19,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:02:19,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:02:19,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:02:19,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:02:19,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:02:19,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:02:19,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:02:19,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:02:19,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:02:19,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:02:19,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:02:19,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:02:19,363 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:19,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:02:19,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:02:19,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:02:19,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:02:19,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:02:19,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:02:19,419 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:02:19,420 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:02:19,420 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:02:19,421 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:02:19,421 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:02:19,422 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:02:19,422 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:02:19,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:02:19,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:02:19,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:02:19,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:02:19,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:02:19,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:02:19,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:02:19,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:02:19,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:02:19,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:02:19,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:02:19,424 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:02:19,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:02:19,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:02:19,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:02:19,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:02:19,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:02:19,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:02:19,426 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 12:02:19,428 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:02:19,428 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:19,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:02:19,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:02:19,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:02:19,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:02:19,902 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:02:19,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2022-07-22 12:02:19,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad7f6d2e/91116aafdd33424585621957e557b056/FLAG88539c77d [2022-07-22 12:02:20,665 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:02:20,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2022-07-22 12:02:20,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad7f6d2e/91116aafdd33424585621957e557b056/FLAG88539c77d [2022-07-22 12:02:20,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad7f6d2e/91116aafdd33424585621957e557b056 [2022-07-22 12:02:20,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:02:20,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:02:20,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:02:20,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:02:20,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:02:20,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:20" (1/1) ... [2022-07-22 12:02:20,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73dca08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:20, skipping insertion in model container [2022-07-22 12:02:20,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:02:20" (1/1) ... [2022-07-22 12:02:20,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:02:21,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:02:21,218 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-5.wvr.c[2644,2657] [2022-07-22 12:02:21,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:02:21,237 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:02:21,267 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-5.wvr.c[2644,2657] [2022-07-22 12:02:21,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:02:21,292 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:02:21,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:21 WrapperNode [2022-07-22 12:02:21,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:02:21,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:02:21,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:02:21,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:02:21,333 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:21" (1/1) ... [2022-07-22 12:02:21,375 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:21" (1/1) ... [2022-07-22 12:02:21,442 INFO L137 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 162 [2022-07-22 12:02:21,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:02:21,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:02:21,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:02:21,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:02:21,457 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:21" (1/1) ... [2022-07-22 12:02:21,458 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:21" (1/1) ... [2022-07-22 12:02:21,461 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:21" (1/1) ... [2022-07-22 12:02:21,462 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:21" (1/1) ... [2022-07-22 12:02:21,470 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:21" (1/1) ... [2022-07-22 12:02:21,476 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:21" (1/1) ... [2022-07-22 12:02:21,479 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:21" (1/1) ... [2022-07-22 12:02:21,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:02:21,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:02:21,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:02:21,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:02:21,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:21" (1/1) ... [2022-07-22 12:02:21,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:21,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:21,539 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:21,555 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:21,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:02:21,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:02:21,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:02:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:02:21,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:02:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:02:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:02:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:02:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:02:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:02:21,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:02:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:02:21,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:02:21,633 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:21,771 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:02:21,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:02:22,138 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:02:22,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:02:22,155 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:02:22,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:22 BoogieIcfgContainer [2022-07-22 12:02:22,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:02:22,160 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:02:22,161 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:02:22,166 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:02:22,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:22,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:02:20" (1/3) ... [2022-07-22 12:02:22,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c80ed83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:22, skipping insertion in model container [2022-07-22 12:02:22,168 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:22,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:02:21" (2/3) ... [2022-07-22 12:02:22,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c80ed83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:02:22, skipping insertion in model container [2022-07-22 12:02:22,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:02:22,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:02:22" (3/3) ... [2022-07-22 12:02:22,172 INFO L322 chiAutomizerObserver]: Analyzing ICFG unroll-5.wvr.c [2022-07-22 12:02:22,390 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:02:22,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 212 transitions, 440 flow [2022-07-22 12:02:22,648 INFO L129 PetriNetUnfolder]: 17/208 cut-off events. [2022-07-22 12:02:22,649 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:02:22,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 208 events. 17/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2022-07-22 12:02:22,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 212 transitions, 440 flow [2022-07-22 12:02:22,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 208 transitions, 428 flow [2022-07-22 12:02:22,707 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:02:22,707 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:02:22,708 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:02:22,708 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:02:22,708 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:02:22,708 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:02:22,708 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:02:22,709 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:02:22,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:02:23,431 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 5264 [2022-07-22 12:02:23,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:23,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:23,440 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:23,441 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:02:23,441 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:02:23,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 5450 states, but on-demand construction may add more states [2022-07-22 12:02:23,545 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 5264 [2022-07-22 12:02:23,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:23,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:23,548 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:23,548 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:02:23,556 INFO L748 eck$LassoCheckResult]: Stem: 203#[ULTIMATE.startENTRY]don't care [474] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 206#[L-1]don't care [414] 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] 208#[L-1-1]don't care [478] L-1-1-->L-1-2: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 210#[L-1-2]don't care [481] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 212#[L21]don't care [352] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 214#[L21-1]don't care [470] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 216#[L21-2]don't care [420] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_9| 1) 1) 0) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 218#[L21-3]don't care [449] L21-3-->L21-4: Formula: (and (= (select |v_#valid_14| 2) 1) (= (select |v_#length_9| 2) 15)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 220#[L21-4]don't care [326] L21-4-->L42: Formula: (and (= v_~f~0.base_7 0) (= v_~f~0.offset_7 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_7, ~f~0.offset=v_~f~0.offset_7} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 222#[L42]don't care [322] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 224#[L42-1]don't care [471] L42-1-->L42-2: Formula: (= v_~x2~0_17 0) InVars {} OutVars{~x2~0=v_~x2~0_17} AuxVars[] AssignedVars[~x2~0] 226#[L42-2]don't care [433] L42-2-->L43: Formula: (= 0 v_~size~0_7) InVars {} OutVars{~size~0=v_~size~0_7} AuxVars[] AssignedVars[~size~0] 228#[L43]don't care [476] L43-->L-1-3: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 230#[L-1-3]don't care [486] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 232#[L-1-4]don't care [309] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 234#[L-1-5]don't care [399] 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] 236#[L-1-6]don't care [467] L-1-6-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_1|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base] 238#[L80]don't care [396] L80-->L80-1: Formula: (and (= (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1) |v_#valid_15|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_10|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 240#[L80-1]don't care [469] L80-1-->L80-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 242#[L80-2]don't care [294] L80-2-->L83: Formula: (= |v_ULTIMATE.start_main_#t~nondet13#1_2| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[~n~0] 244#[L83]don't care [297] L83-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 246#[L84]don't care [376] L84-->L84-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet14#1_2| v_~size~0_8) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} OutVars{~size~0=v_~size~0_8, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[~size~0] 248#[L84-1]don't care [384] L84-1-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 250#[L85]don't care [307] L85-->L85-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 252#[L85-1]don't care [316] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_9) 1 0)) InVars {~size~0=v_~size~0_9} OutVars{~size~0=v_~size~0_9, 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] 254#[L85-2]don't care [392] L85-2-->L37: 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] 256#[L37]don't care [323] L37-->L38: 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] 258#[L38]don't care [435] L38-->L37-1: 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[] 262#[L37-1]don't care [428] L37-1-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 264#[L86]don't care [391] L86-->L86-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 266#[L86-1]don't care [337] L86-1-->L86-2: Formula: (= v_~size~0_10 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_10} 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_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 268#[L86-2]don't care [390] L86-2-->L86-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] 270#[L86-3]don't care [421] L86-3-->L102: 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~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 272#[L102]don't care [310] L102-->L103: 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] 274#[L103]don't care [472] L103-->L103-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 276#[L103-1]don't care [308] L103-1-->L103-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 278#[L103-2]don't care [452] L103-2-->L37-2: 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] 280#[L37-2]don't care [401] L37-2-->L38-3: 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] 282#[L38-3]don't care [306] L38-3-->L37-3: 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[] 286#[L37-3]don't care [300] L37-3-->L104: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 288#[L104]don't care [293] L104-->L104-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 290#[L104-1]don't care [487] L104-1-->L104-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_7|) 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_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 292#[L104-2]don't care [489] L104-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 294#[L37-4]don't care [465] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 296#[L38-6]don't care [350] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 300#[L37-5]don't care [339] L37-5-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 302#[L106]don't care [375] L106-->L106-1: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1) |v_#valid_19|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (= (store |v_#length_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_14|) (= (select |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_19|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_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~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 304#[L106-1]don't care [371] L106-1-->L106-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_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~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_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~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 306#[L106-2]don't care [315] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 308#[L107]don't care [385] L107-->L107-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] 310#[L107-6]don't care [2022-07-22 12:02:23,557 INFO L750 eck$LassoCheckResult]: Loop: 310#[L107-6]don't care [357] L107-6-->L108: 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[] 314#[L108]don't care [295] L108-->L108-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) (= (select |v_#valid_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) 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_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} 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_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} AuxVars[] AssignedVars[#memory_int] 318#[L108-1]don't care [448] L108-1-->L107-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet24#1] 322#[L107-3]don't care [327] L107-3-->L107-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post23#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_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 326#[L107-4]don't care [334] L107-4-->L107-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 330#[L107-5]don't care [442] L107-5-->L107-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 310#[L107-6]don't care [2022-07-22 12:02:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:23,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1466788862, now seen corresponding path program 1 times [2022-07-22 12:02:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:23,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869016525] [2022-07-22 12:02:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:23,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:23,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:23,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1490681194, now seen corresponding path program 1 times [2022-07-22 12:02:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:23,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337675288] [2022-07-22 12:02:23,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:23,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:23,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1767887319, now seen corresponding path program 1 times [2022-07-22 12:02:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:23,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809362375] [2022-07-22 12:02:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:23,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:23,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:25,291 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:25,292 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:25,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:25,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:25,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:25,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:25,293 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:25,293 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:25,294 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-5.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:02:25,294 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:25,294 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:25,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:25,330 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:25,332 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:25,335 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:25,338 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:25,342 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:25,345 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:25,347 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:25,349 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:25,351 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:25,353 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:25,355 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:25,359 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:25,362 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:25,370 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:25,372 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:25,376 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:25,378 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:25,384 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:25,387 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:25,775 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:25,784 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:25,785 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:25,787 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:25,790 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:25,791 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:25,794 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:25,797 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:25,800 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:25,802 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:25,806 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:26,280 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:02:26,286 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:02:26,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,296 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:26,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:26,306 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:26,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:26,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:26,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,365 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:26,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,368 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:26,369 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:26,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:26,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,425 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:26,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,427 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:26,453 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:26,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:26,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,492 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:26,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,494 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:26,495 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:26,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:26,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,533 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:26,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,535 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:26,536 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:26,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:26,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,570 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:26,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,572 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:26,573 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:26,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:26,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:26,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:26,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 12:02:26,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,626 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:26,638 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:26,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:26,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,701 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:26,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:26,711 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:26,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,769 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:26,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,772 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:26,776 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:26,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:26,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,812 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:26,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,814 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:26,814 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:26,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:26,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,862 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:26,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,864 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:26,866 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:26,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:26,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:26,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:26,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:26,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,916 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:26,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,918 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:26,928 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:26,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:26,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:26,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:26,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:26,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:26,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:26,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:26,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:26,989 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:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:26,991 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:26,994 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:26,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,061 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:27,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,063 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:27,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,085 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:27,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,130 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:27,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,133 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:27,136 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:27,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:27,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:27,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:27,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,171 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:27,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,173 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:27,175 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:27,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:27,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,235 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:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,237 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:27,238 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:27,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:27,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:27,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:27,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,302 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:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,303 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:27,309 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:27,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:27,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,359 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:27,361 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:27,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,403 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:27,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,405 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:27,407 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:27,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,453 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:27,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,455 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:27,456 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:27,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,498 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:27,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,499 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:27,501 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:27,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:27,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,541 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:27,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,542 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:27,543 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:27,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:02:27,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,583 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:27,584 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:27,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:27,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,655 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:27,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:27,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,668 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:02:27,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,672 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:02:27,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,679 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:27,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,714 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:27,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,716 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:27,717 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:27,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 12:02:27,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,756 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:27,758 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:27,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,799 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:27,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,800 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:27,801 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:27,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:27,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:02:27,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,839 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:27,840 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:27,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:27,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,909 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:27,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:27,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:27,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:27,922 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:27,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:02:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,954 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:27,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:27,961 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:27,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:27,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:27,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:27,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:27,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:27,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:27,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:27,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 12:02:27,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:27,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:27,995 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:27,997 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:28,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:28,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:28,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:28,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:28,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:28,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:28,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:28,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-22 12:02:28,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:28,040 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:28,043 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:28,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:28,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:28,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:28,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:28,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:28,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:28,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:28,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 12:02:28,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:28,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:28,083 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:28,084 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:28,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:02:28,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:28,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:02:28,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:28,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:28,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:28,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:02:28,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:02:28,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:02:28,146 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:28,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:28,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:28,148 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:28,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:02:28,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:02:28,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:02:28,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:02:28,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:02:28,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:02:28,175 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:28,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:02:28,232 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-07-22 12:02:28,232 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-22 12:02:28,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:28,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:02:28,243 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:28,281 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:28,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:02:28,305 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:02:28,305 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:02:28,306 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~2#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~2#1 Supporting invariants [-4*ULTIMATE.start_create_fresh_int_array_~size#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 >= 0] [2022-07-22 12:02:28,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:02:28,442 INFO L257 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2022-07-22 12:02:28,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:28,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 12:02:28,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:28,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 12:02:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:28,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 12:02:28,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:28,849 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:28,863 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:28,902 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2022-07-22 12:02:28,906 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 5450 states, but on-demand construction may add more states Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:29,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 5450 states, but on-demand construction may add more states. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10887 states and 31224 transitions. Complement of second has 11 states. [2022-07-22 12:02:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:02:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 240 transitions. [2022-07-22 12:02:29,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 240 transitions. Stem has 50 letters. Loop has 6 letters. [2022-07-22 12:02:29,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:29,310 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:02:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:29,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 12:02:29,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:29,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 12:02:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:29,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 12:02:29,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:02:29,579 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:29,580 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2022-07-22 12:02:29,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 5450 states, but on-demand construction may add more states Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:29,982 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 5450 states, but on-demand construction may add more states. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10881 states and 31217 transitions. Complement of second has 13 states. [2022-07-22 12:02:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 12:02:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:02:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2022-07-22 12:02:29,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 241 transitions. Stem has 50 letters. Loop has 6 letters. [2022-07-22 12:02:29,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:29,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 241 transitions. Stem has 56 letters. Loop has 6 letters. [2022-07-22 12:02:29,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:29,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 241 transitions. Stem has 50 letters. Loop has 12 letters. [2022-07-22 12:02:29,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:02:29,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10881 states and 31217 transitions. [2022-07-22 12:02:30,148 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 5258 [2022-07-22 12:02:30,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10881 states to 5386 states and 15450 transitions. [2022-07-22 12:02:30,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5379 [2022-07-22 12:02:30,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5380 [2022-07-22 12:02:30,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5386 states and 15450 transitions. [2022-07-22 12:02:30,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:30,277 INFO L220 hiAutomatonCegarLoop]: Abstraction has 5386 states and 15450 transitions. [2022-07-22 12:02:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states and 15450 transitions. [2022-07-22 12:02:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 5386. [2022-07-22 12:02:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5386 states, 5386 states have (on average 2.868548087634608) internal successors, (15450), 5385 states have internal predecessors, (15450), 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:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5386 states to 5386 states and 15450 transitions. [2022-07-22 12:02:30,619 INFO L242 hiAutomatonCegarLoop]: Abstraction has 5386 states and 15450 transitions. [2022-07-22 12:02:30,619 INFO L425 stractBuchiCegarLoop]: Abstraction has 5386 states and 15450 transitions. [2022-07-22 12:02:30,619 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:02:30,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5386 states and 15450 transitions. [2022-07-22 12:02:30,667 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 5258 [2022-07-22 12:02:30,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:30,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:30,673 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:30,673 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:30,675 INFO L748 eck$LassoCheckResult]: Stem: 43750#[ULTIMATE.startENTRY]don't care [474] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43752#[L-1]don't care [414] 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] 37696#[L-1-1]don't care [478] L-1-1-->L-1-2: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 37698#[L-1-2]don't care [481] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 43050#[L21]don't care [352] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 39146#[L21-1]don't care [470] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 34848#[L21-2]don't care [420] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_9| 1) 1) 0) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 34850#[L21-3]don't care [449] L21-3-->L21-4: Formula: (and (= (select |v_#valid_14| 2) 1) (= (select |v_#length_9| 2) 15)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 42444#[L21-4]don't care [326] L21-4-->L42: Formula: (and (= v_~f~0.base_7 0) (= v_~f~0.offset_7 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_7, ~f~0.offset=v_~f~0.offset_7} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 41740#[L42]don't care [322] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 41742#[L42-1]don't care [471] L42-1-->L42-2: Formula: (= v_~x2~0_17 0) InVars {} OutVars{~x2~0=v_~x2~0_17} AuxVars[] AssignedVars[~x2~0] 41294#[L42-2]don't care [433] L42-2-->L43: Formula: (= 0 v_~size~0_7) InVars {} OutVars{~size~0=v_~size~0_7} AuxVars[] AssignedVars[~size~0] 40584#[L43]don't care [476] L43-->L-1-3: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 39198#[L-1-3]don't care [486] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 39200#[L-1-4]don't care [309] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43340#[L-1-5]don't care [399] 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] 43550#[L-1-6]don't care [467] L-1-6-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_1|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base] 34456#[L80]don't care [396] L80-->L80-1: Formula: (and (= (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1) |v_#valid_15|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_10|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 34458#[L80-1]don't care [469] L80-1-->L80-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 35700#[L80-2]don't care [294] L80-2-->L83: Formula: (= |v_ULTIMATE.start_main_#t~nondet13#1_2| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[~n~0] 35702#[L83]don't care [297] L83-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 43082#[L84]don't care [376] L84-->L84-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet14#1_2| v_~size~0_8) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} OutVars{~size~0=v_~size~0_8, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[~size~0] 41916#[L84-1]don't care [384] L84-1-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 41918#[L85]don't care [307] L85-->L85-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 42368#[L85-1]don't care [316] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_9) 1 0)) InVars {~size~0=v_~size~0_9} OutVars{~size~0=v_~size~0_9, 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] 41102#[L85-2]don't care [392] L85-2-->L37: 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] 41104#[L37]don't care [323] L37-->L38: 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] 37228#[L38]don't care [435] L38-->L37-1: 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[] 37230#[L37-1]don't care [428] L37-1-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 42110#[L86]don't care [391] L86-->L86-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43914#[L86-1]don't care [337] L86-1-->L86-2: Formula: (= v_~size~0_10 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_10} 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_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 41946#[L86-2]don't care [390] L86-2-->L86-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] 41948#[L86-3]don't care [421] L86-3-->L102: 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~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 35944#[L102]don't care [310] L102-->L103: 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] 35946#[L103]don't care [472] L103-->L103-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 35920#[L103-1]don't care [308] L103-1-->L103-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 35922#[L103-2]don't care [452] L103-2-->L37-2: 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] 36830#[L37-2]don't care [401] L37-2-->L38-3: 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] 36832#[L38-3]don't care [306] L38-3-->L37-3: 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[] 44002#[L37-3]don't care [300] L37-3-->L104: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 42906#[L104]don't care [293] L104-->L104-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 42908#[L104-1]don't care [487] L104-1-->L104-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_7|) 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_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 43562#[L104-2]don't care [489] L104-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 43758#[L37-4]don't care [465] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 43632#[L38-6]don't care [350] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 43382#[L37-5]don't care [339] L37-5-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43384#[L106]don't care [375] L106-->L106-1: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1) |v_#valid_19|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (= (store |v_#length_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_14|) (= (select |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_19|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_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~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 44036#[L106-1]don't care [371] L106-1-->L106-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_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~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_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~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 41718#[L106-2]don't care [315] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 41720#[L107]don't care [385] L107-->L107-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] 39806#[L107-6]don't care [356] L107-6-->L107-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[] 36870#[L107-7]don't care [406] L107-7-->L110: 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] 36872#[L110]don't care [332] L110-->L86-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret15#1.offset_2|)) 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_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 43138#[L86-4]don't care [407] L86-4-->L86-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43140#[L86-5]don't care [410] L86-5-->L86-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_3| v_~f~0.base_8) (= |v_ULTIMATE.start_main_#t~ret15#1.offset_3| v_~f~0.offset_8)) InVars {ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|, ~f~0.base=v_~f~0.base_8, ~f~0.offset=v_~f~0.offset_8} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 42848#[L86-6]don't care [462] L86-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_4|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 42850#[L88]don't care [348] L88-->L88-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44030#[L88-1]don't care [373] L88-1-->L88-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (ite (< (mod v_~n~0_7 4294967296) 858993459) 1 0)) InVars {~n~0=v_~n~0_7} OutVars{~n~0=v_~n~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 44038#[L88-2]don't care [292] L88-2-->L37-6: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 44082#[L37-6]don't care [437] L37-6-->L38-9: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_18| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 44106#[L38-9]don't care [382] L38-9-->L37-7: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_20| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[] 36820#[L37-7]don't care [344] L37-7-->L91: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44026#[L91]don't care [405] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~pre16#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1] 43962#[L91-1]don't care [413] L91-1-->L91-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 36132#[L91-2]don't care [331] L91-2-->L91-3: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre16#1_3|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 36134#[L91-3]don't care [588] L91-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#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|, 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, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, 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] 41730#[L91-4, thread1ENTRY]don't care [490] 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] 41732#[L91-4, L49-2]don't care [2022-07-22 12:02:30,676 INFO L750 eck$LassoCheckResult]: Loop: 41732#[L91-4, L49-2]don't care [493] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_5| 4294967296) (mod (* 5 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[] 44000#[L50, L91-4]don't care [495] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 36834#[L50-1, L91-4]don't care [497] 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] 36836#[L50-2, L91-4]don't care [498] 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] 43884#[L91-4, L37]don't care [499] 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] 42538#[L38, L91-4]don't care [501] 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[] 41428#[L37-1, L91-4]don't care [503] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 41432#[L51, L91-4]don't care [504] 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] 39176#[L91-4, L51-1]don't care [505] 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] 39180#[L91-4, L51-2]don't care [506] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 42930#[L91-4, L52]don't care [507] 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] 42932#[L52-1, L91-4]don't care [508] 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] 43998#[L91-4, L52-2]don't care [509] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 41732#[L91-4, L49-2]don't care [2022-07-22 12:02:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1331358614, now seen corresponding path program 1 times [2022-07-22 12:02:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:30,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775706768] [2022-07-22 12:02:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:02:31,043 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:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:02:31,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775706768] [2022-07-22 12:02:31,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775706768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:02:31,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:02:31,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 12:02:31,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808203497] [2022-07-22 12:02:31,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:02:31,049 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:02:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:31,050 INFO L85 PathProgramCache]: Analyzing trace with hash 297881300, now seen corresponding path program 1 times [2022-07-22 12:02:31,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:31,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770728218] [2022-07-22 12:02:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:31,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:31,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:31,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:02:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 12:02:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 12:02:31,177 INFO L87 Difference]: Start difference. First operand 5386 states and 15450 transitions. cyclomatic complexity: 10110 Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:02:31,333 INFO L93 Difference]: Finished difference Result 5390 states and 14457 transitions. [2022-07-22 12:02:31,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5390 states and 14457 transitions. [2022-07-22 12:02:31,395 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 5121 [2022-07-22 12:02:31,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5390 states to 5282 states and 14173 transitions. [2022-07-22 12:02:31,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5272 [2022-07-22 12:02:31,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5272 [2022-07-22 12:02:31,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5282 states and 14173 transitions. [2022-07-22 12:02:31,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:02:31,478 INFO L220 hiAutomatonCegarLoop]: Abstraction has 5282 states and 14173 transitions. [2022-07-22 12:02:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states and 14173 transitions. [2022-07-22 12:02:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5278. [2022-07-22 12:02:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5278 states, 5278 states have (on average 2.6845395983327016) internal successors, (14169), 5277 states have internal predecessors, (14169), 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:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 14169 transitions. [2022-07-22 12:02:31,744 INFO L242 hiAutomatonCegarLoop]: Abstraction has 5278 states and 14169 transitions. [2022-07-22 12:02:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 12:02:31,746 INFO L425 stractBuchiCegarLoop]: Abstraction has 5278 states and 14169 transitions. [2022-07-22 12:02:31,746 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:02:31,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5278 states and 14169 transitions. [2022-07-22 12:02:31,794 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 5121 [2022-07-22 12:02:31,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:02:31,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:02:31,798 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, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:31,799 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:02:31,851 INFO L748 eck$LassoCheckResult]: Stem: 59691#[ULTIMATE.startENTRY]don't care [474] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59693#[L-1]don't care [414] 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] 53667#[L-1-1]don't care [478] L-1-1-->L-1-2: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 53669#[L-1-2]don't care [481] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 58943#[L21]don't care [352] L21-->L21-1: Formula: (and (= (select |v_#valid_13| 1) 1) (= (select |v_#length_8| 1) 2)) InVars {#length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 55077#[L21-1]don't care [470] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 50977#[L21-2]don't care [420] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_9| 1) 1) 0) InVars {#memory_int=|v_#memory_int_9|} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[] 50979#[L21-3]don't care [449] L21-3-->L21-4: Formula: (and (= (select |v_#valid_14| 2) 1) (= (select |v_#length_9| 2) 15)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 58331#[L21-4]don't care [326] L21-4-->L42: Formula: (and (= v_~f~0.base_7 0) (= v_~f~0.offset_7 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_7, ~f~0.offset=v_~f~0.offset_7} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 57645#[L42]don't care [322] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 57647#[L42-1]don't care [471] L42-1-->L42-2: Formula: (= v_~x2~0_17 0) InVars {} OutVars{~x2~0=v_~x2~0_17} AuxVars[] AssignedVars[~x2~0] 57203#[L42-2]don't care [433] L42-2-->L43: Formula: (= 0 v_~size~0_7) InVars {} OutVars{~size~0=v_~size~0_7} AuxVars[] AssignedVars[~size~0] 56495#[L43]don't care [476] L43-->L-1-3: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 55129#[L-1-3]don't care [486] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 55131#[L-1-4]don't care [309] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59245#[L-1-5]don't care [399] 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] 59471#[L-1-6]don't care [467] L-1-6-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_1|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_1|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_1|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_~#t2~0#1.base] 50603#[L80]don't care [396] L80-->L80-1: Formula: (and (= (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1) |v_#valid_15|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 0) (= (store |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_10|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_11|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 50605#[L80-1]don't care [469] L80-1-->L80-2: Formula: (and (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_17|) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 51781#[L80-2]don't care [294] L80-2-->L83: Formula: (= |v_ULTIMATE.start_main_#t~nondet13#1_2| v_~n~0_6) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[~n~0] 51783#[L83]don't care [297] L83-->L84: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] 58973#[L84]don't care [376] L84-->L84-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet14#1_2| v_~size~0_8) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} OutVars{~size~0=v_~size~0_8, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[~size~0] 57811#[L84-1]don't care [384] L84-1-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 57813#[L85]don't care [307] L85-->L85-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 58251#[L85-1]don't care [316] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (< 0 v_~size~0_9) 1 0)) InVars {~size~0=v_~size~0_9} OutVars{~size~0=v_~size~0_9, 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] 57005#[L85-2]don't care [392] L85-2-->L37: 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] 57007#[L37]don't care [323] L37-->L38: 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] 53241#[L38]don't care [435] L38-->L37-1: 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[] 53243#[L37-1]don't care [428] L37-1-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 58009#[L86]don't care [391] L86-->L86-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59859#[L86-1]don't care [337] L86-1-->L86-2: Formula: (= v_~size~0_10 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|) InVars {~size~0=v_~size~0_10} 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_10} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 57843#[L86-2]don't care [390] L86-2-->L86-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] 57845#[L86-3]don't care [421] L86-3-->L102: 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~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 52021#[L102]don't care [310] L102-->L103: 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] 52023#[L103]don't care [472] L103-->L103-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51999#[L103-1]don't care [308] L103-1-->L103-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (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_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 52001#[L103-2]don't care [452] L103-2-->L37-2: 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] 52865#[L37-2]don't care [401] L37-2-->L38-3: 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] 52867#[L38-3]don't care [306] L38-3-->L37-3: 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[] 59957#[L37-3]don't care [300] L37-3-->L104: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 58801#[L104]don't care [293] L104-->L104-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 58803#[L104-1]don't care [487] L104-1-->L104-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_7|) 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_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 59483#[L104-2]don't care [489] L104-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 59699#[L37-4]don't care [465] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 59559#[L38-6]don't care [350] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 59291#[L37-5]don't care [339] L37-5-->L106: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59293#[L106]don't care [375] L106-->L106-1: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 1) |v_#valid_19|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2| 0) (= (store |v_#length_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_14|) (= (select |v_#valid_20| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_19|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_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~malloc22#1.offset, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 59995#[L106-1]don't care [371] L106-1-->L106-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_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~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_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~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 57623#[L106-2]don't care [315] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base] 57625#[L107]don't care [385] L107-->L107-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] 55725#[L107-6]don't care [357] L107-6-->L108: 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[] 55727#[L108]don't care [295] L108-->L108-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) (= (select |v_#valid_21| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) 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_21|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} 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_21|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_2|} AuxVars[] AssignedVars[#memory_int] 56633#[L108-1]don't care [448] L108-1-->L107-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet24#1] 59275#[L107-3]don't care [327] L107-3-->L107-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post23#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_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 59277#[L107-4]don't care [334] L107-4-->L107-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 59799#[L107-5]don't care [442] L107-5-->L107-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post23#1] 55729#[L107-6]don't care [356] L107-6-->L107-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[] 52901#[L107-7]don't care [406] L107-7-->L110: 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] 52903#[L110]don't care [332] L110-->L86-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret15#1.offset_2|)) 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_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 59031#[L86-4]don't care [407] L86-4-->L86-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59033#[L86-5]don't care [410] L86-5-->L86-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret15#1.base_3| v_~f~0.base_8) (= |v_ULTIMATE.start_main_#t~ret15#1.offset_3| v_~f~0.offset_8)) InVars {ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_3|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_3|, ~f~0.base=v_~f~0.base_8, ~f~0.offset=v_~f~0.offset_8} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] 58743#[L86-6]don't care [462] L86-6-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_4|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_#t~ret15#1.base] 58745#[L88]don't care [348] L88-->L88-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59989#[L88-1]don't care [373] L88-1-->L88-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (ite (< (mod v_~n~0_7 4294967296) 858993459) 1 0)) InVars {~n~0=v_~n~0_7} OutVars{~n~0=v_~n~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 59997#[L88-2]don't care [292] L88-2-->L37-6: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 60045#[L37-6]don't care [437] L37-6-->L38-9: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_18| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 60071#[L38-9]don't care [382] L38-9-->L37-7: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_20| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[] 59983#[L37-7]don't care [344] L37-7-->L91: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 59985#[L91]don't care [405] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~pre16#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1] 59911#[L91-1]don't care [413] L91-1-->L91-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 52209#[L91-2]don't care [331] L91-2-->L91-3: Formula: (and (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (= |v_#memory_int_12| (store |v_#memory_int_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre16#1_3|))) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 52211#[L91-3]don't care [588] L91-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#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|, 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, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, 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] 57635#[L91-4, thread1ENTRY]don't care [490] 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] 57637#[L91-4, L49-2]don't care [2022-07-22 12:02:31,852 INFO L750 eck$LassoCheckResult]: Loop: 57637#[L91-4, L49-2]don't care [493] L49-2-->L50: Formula: (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_5| 4294967296) (mod (* 5 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[] 59959#[L50, L91-4]don't care [495] L50-->L50-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 52875#[L50-1, L91-4]don't care [497] 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] 52877#[L50-2, L91-4]don't care [498] 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] 59827#[L91-4, L37]don't care [499] 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] 58423#[L38, L91-4]don't care [501] 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[] 57335#[L37-1, L91-4]don't care [503] L37-1-->L51: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 57339#[L51, L91-4]don't care [504] 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] 55107#[L91-4, L51-1]don't care [505] 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] 55111#[L91-4, L51-2]don't care [506] L51-2-->L52: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 58819#[L91-4, L52]don't care [507] 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] 58821#[L52-1, L91-4]don't care [508] 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] 59953#[L91-4, L52-2]don't care [509] L52-2-->L49-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1] 57637#[L91-4, L49-2]don't care [2022-07-22 12:02:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1404738357, now seen corresponding path program 1 times [2022-07-22 12:02:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:31,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971294206] [2022-07-22 12:02:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:31,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:31,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash 297881300, now seen corresponding path program 2 times [2022-07-22 12:02:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:31,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054609467] [2022-07-22 12:02:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:31,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:32,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:32,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:02:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1181190176, now seen corresponding path program 1 times [2022-07-22 12:02:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:02:32,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567653926] [2022-07-22 12:02:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:02:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:02:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:32,070 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:02:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:02:32,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:02:34,171 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:02:34,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:02:34,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:02:34,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:02:34,172 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:02:34,172 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:02:34,172 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:02:34,172 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:02:34,172 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-5.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:02:34,172 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:02:34,172 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:02:34,177 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:34,179 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:34,180 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:34,182 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:34,186 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:34,190 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:34,192 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:34,193 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:34,195 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:34,196 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:34,198 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:34,200 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:34,201 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:34,203 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:34,205 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:34,206 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:34,208 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:34,210 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:34,211 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:34,212 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:34,223 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:34,227 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:34,228 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:34,230 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:34,446 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:34,450 INFO L158 Benchmark]: Toolchain (without parser) took 13486.50ms. Allocated memory was 151.0MB in the beginning and 347.1MB in the end (delta: 196.1MB). Free memory was 131.6MB in the beginning and 188.7MB in the end (delta: -57.1MB). Peak memory consumption was 189.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:34,451 INFO L158 Benchmark]: CDTParser took 0.33ms. 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:34,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.23ms. Allocated memory is still 151.0MB. Free memory was 131.4MB in the beginning and 119.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:02:34,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.64ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 132.9MB in the end (delta: -13.1MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. [2022-07-22 12:02:34,452 INFO L158 Benchmark]: Boogie Preprocessor took 37.15ms. Allocated memory is still 151.0MB. Free memory was 132.9MB in the beginning and 131.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:02:34,453 INFO L158 Benchmark]: RCFGBuilder took 676.19ms. Allocated memory is still 151.0MB. Free memory was 131.2MB in the beginning and 114.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-07-22 12:02:34,453 INFO L158 Benchmark]: BuchiAutomizer took 12288.37ms. Allocated memory was 151.0MB in the beginning and 347.1MB in the end (delta: 196.1MB). Free memory was 114.3MB in the beginning and 188.7MB in the end (delta: -74.4MB). Peak memory consumption was 173.3MB. Max. memory is 8.0GB. [2022-07-22 12:02:34,456 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.33ms. Allocated memory is still 151.0MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.23ms. Allocated memory is still 151.0MB. Free memory was 131.4MB in the beginning and 119.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 149.64ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 132.9MB in the end (delta: -13.1MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.15ms. Allocated memory is still 151.0MB. Free memory was 132.9MB in the beginning and 131.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 676.19ms. Allocated memory is still 151.0MB. Free memory was 131.2MB in the beginning and 114.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 12288.37ms. Allocated memory was 151.0MB in the beginning and 347.1MB in the end (delta: 196.1MB). Free memory was 114.3MB in the beginning and 188.7MB in the end (delta: -74.4MB). Peak memory consumption was 173.3MB. 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:34,471 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...