./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:38:58,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:38:58,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:38:58,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:38:58,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:38:58,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:38:58,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:38:58,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:38:58,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:38:58,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:38:58,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:38:58,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:38:58,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:38:58,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:38:58,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:38:58,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:38:58,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:38:58,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:38:58,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:38:58,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:38:58,297 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:38:58,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:38:58,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:38:58,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:38:58,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:38:58,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:38:58,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:38:58,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:38:58,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:38:58,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:38:58,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:38:58,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:38:58,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:38:58,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:38:58,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:38:58,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:38:58,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:38:58,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:38:58,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:38:58,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:38:58,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:38:58,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:38:58,318 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:38:58,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:38:58,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:38:58,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:38:58,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:38:58,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:38:58,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:38:58,359 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:38:58,359 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:38:58,359 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:38:58,360 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:38:58,360 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:38:58,361 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:38:58,361 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:38:58,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:38:58,361 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:38:58,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:38:58,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:38:58,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:38:58,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:38:58,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:38:58,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:38:58,363 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:38:58,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:38:58,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:38:58,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:38:58,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:38:58,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:38:58,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:38:58,366 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:38:58,366 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 [2022-07-22 01:38:58,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:38:58,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:38:58,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:38:58,710 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:38:58,711 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:38:58,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2022-07-22 01:38:58,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61bd332d2/898d0d6094f44f3186895019f9c1e039/FLAGcf7b60322 [2022-07-22 01:38:59,298 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:38:59,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2022-07-22 01:38:59,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61bd332d2/898d0d6094f44f3186895019f9c1e039/FLAGcf7b60322 [2022-07-22 01:38:59,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61bd332d2/898d0d6094f44f3186895019f9c1e039 [2022-07-22 01:38:59,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:38:59,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:38:59,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:38:59,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:38:59,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:38:59,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:38:59,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bfc20c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59, skipping insertion in model container [2022-07-22 01:38:59,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:38:59,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:38:59,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:38:59,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:38:59,892 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:38:59,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:38:59,959 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:38:59,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59 WrapperNode [2022-07-22 01:38:59,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:38:59,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:38:59,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:38:59,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:38:59,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:38:59,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,008 INFO L137 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-07-22 01:39:00,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:39:00,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:39:00,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:39:00,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:39:00,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:39:00,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:39:00,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:39:00,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:39:00,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (1/1) ... [2022-07-22 01:39:00,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:00,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:00,120 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 01:39:00,122 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 01:39:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:39:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:39:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 01:39:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:39:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:39:00,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:39:00,261 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:39:00,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:39:00,468 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:39:00,473 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:39:00,479 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 01:39:00,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:39:00 BoogieIcfgContainer [2022-07-22 01:39:00,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:39:00,483 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:39:00,483 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:39:00,486 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:39:00,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:39:00,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:38:59" (1/3) ... [2022-07-22 01:39:00,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5687317b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:39:00, skipping insertion in model container [2022-07-22 01:39:00,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:39:00,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:59" (2/3) ... [2022-07-22 01:39:00,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5687317b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:39:00, skipping insertion in model container [2022-07-22 01:39:00,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:39:00,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:39:00" (3/3) ... [2022-07-22 01:39:00,491 INFO L354 chiAutomizerObserver]: Analyzing ICFG c.08-alloca.i [2022-07-22 01:39:00,548 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:39:00,548 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:39:00,548 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:39:00,548 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:39:00,548 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:39:00,548 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:39:00,549 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:39:00,549 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:39:00,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:39:00,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:00,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:00,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:00,594 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:39:00,595 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:39:00,595 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:39:00,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:39:00,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:00,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:00,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:00,598 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:39:00,598 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:39:00,604 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 5#L555-3true [2022-07-22 01:39:00,605 INFO L754 eck$LassoCheckResult]: Loop: 5#L555-3true call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 10#L555-1true assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 9#L557-3true assume !true; 12#L557-4true call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 5#L555-3true [2022-07-22 01:39:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 01:39:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:00,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255917949] [2022-07-22 01:39:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:00,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:00,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2022-07-22 01:39:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:00,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303332498] [2022-07-22 01:39:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:00,931 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 01:39:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:39:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303332498] [2022-07-22 01:39:00,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303332498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:39:00,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:39:00,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:39:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77379572] [2022-07-22 01:39:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:39:00,938 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:39:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:39:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 01:39:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 01:39:00,968 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:39:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:39:00,975 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-07-22 01:39:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 01:39:00,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-07-22 01:39:00,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:00,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2022-07-22 01:39:00,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-22 01:39:00,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-22 01:39:00,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-07-22 01:39:00,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:39:00,990 INFO L369 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-22 01:39:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-07-22 01:39:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-22 01:39:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:39:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-07-22 01:39:01,013 INFO L392 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-22 01:39:01,013 INFO L374 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-22 01:39:01,013 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:39:01,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-07-22 01:39:01,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:01,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:01,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:01,016 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:39:01,016 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:39:01,016 INFO L752 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 34#L555-3 [2022-07-22 01:39:01,016 INFO L754 eck$LassoCheckResult]: Loop: 34#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 35#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 36#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 37#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 38#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 34#L555-3 [2022-07-22 01:39:01,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:01,017 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-22 01:39:01,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:01,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625372709] [2022-07-22 01:39:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:01,067 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:01,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2022-07-22 01:39:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:01,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580967943] [2022-07-22 01:39:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:01,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:01,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2022-07-22 01:39:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:01,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052113266] [2022-07-22 01:39:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:01,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:01,211 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:01,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:02,012 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:39:02,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:39:02,014 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:39:02,014 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:39:02,014 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:39:02,014 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:02,014 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:39:02,014 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:39:02,015 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration2_Lasso [2022-07-22 01:39:02,015 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:39:02,015 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:39:02,035 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 01:39:02,045 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 01:39:02,048 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 01:39:02,051 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 01:39:02,054 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 01:39:02,056 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 01:39:02,059 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 01:39:02,062 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 01:39:02,066 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 01:39:02,069 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 01:39:02,071 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 01:39:02,073 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 01:39:02,075 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 01:39:02,589 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 01:39:02,591 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 01:39:02,594 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 01:39:02,938 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:39:02,942 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:39:02,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:02,946 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 01:39:02,947 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 01:39:02,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:02,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:02,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:02,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:02,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:02,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:02,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:02,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:02,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:02,981 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 01:39:02,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:02,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:02,983 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 01:39:02,983 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 01:39:02,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:02,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:02,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:02,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:02,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:02,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:02,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,048 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 01:39:03,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,049 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 01:39:03,050 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 01:39:03,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:03,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:03,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:03,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,075 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 01:39:03,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,077 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 01:39:03,078 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 01:39:03,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,122 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 01:39:03,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,124 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 01:39:03,125 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 01:39:03,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:03,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:03,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:03,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:03,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,150 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 01:39:03,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,151 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 01:39:03,152 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 01:39:03,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:03,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,191 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 01:39:03,191 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 01:39:03,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:03,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:03,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:03,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,223 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 01:39:03,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,225 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 01:39:03,228 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 01:39:03,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:03,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,264 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 01:39:03,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,265 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 01:39:03,266 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 01:39:03,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:03,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:03,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:03,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 01:39:03,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,295 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 01:39:03,296 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 01:39:03,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:03,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:03,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:03,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,321 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 01:39:03,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,323 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 01:39:03,324 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 01:39:03,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,381 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 01:39:03,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,383 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 01:39:03,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,391 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 01:39:03,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:03,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:03,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:03,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,438 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 01:39:03,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,440 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 01:39:03,443 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 01:39:03,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,481 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 01:39:03,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,483 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 01:39:03,484 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 01:39:03,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 01:39:03,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,539 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 01:39:03,539 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 01:39:03,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 01:39:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,612 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 01:39:03,617 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 01:39:03,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,681 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 01:39:03,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,683 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 01:39:03,689 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 01:39:03,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,734 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 01:39:03,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,735 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 01:39:03,736 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 01:39:03,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:03,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,801 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 01:39:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,803 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 01:39:03,807 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 01:39:03,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:03,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,859 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 01:39:03,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,861 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 01:39:03,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:03,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,888 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 01:39:03,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:03,924 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 01:39:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:03,926 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 01:39:03,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:03,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:03,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:03,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:03,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:03,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:03,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:03,949 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 01:39:03,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:39:04,004 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 01:39:04,005 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 01:39:04,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:04,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:04,011 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 01:39:04,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:39:04,025 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 01:39:04,040 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:39:04,041 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:39:04,041 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_1 + 1 Supporting invariants [] [2022-07-22 01:39:04,066 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 01:39:04,150 INFO L293 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 01:39:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:04,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:39:04,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:04,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 01:39:04,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:04,289 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 01:39:04,325 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-22 01:39:04,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-22 01:39:04,512 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 01:39:04,515 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-22 01:39:04,516 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 01:39:04,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 17 states and 20 transitions. Complement of second has 7 states. [2022-07-22 01:39:04,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:39:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 01:39:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-07-22 01:39:04,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2022-07-22 01:39:04,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:04,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2022-07-22 01:39:04,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:04,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2022-07-22 01:39:04,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:04,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2022-07-22 01:39:04,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:04,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2022-07-22 01:39:04,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-22 01:39:04,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-22 01:39:04,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-07-22 01:39:04,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:04,602 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-22 01:39:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-07-22 01:39:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-22 01:39:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 01:39:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-22 01:39:04,604 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-22 01:39:04,604 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-22 01:39:04,604 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:39:04,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-07-22 01:39:04,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:04,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:04,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:04,606 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 01:39:04,606 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:39:04,606 INFO L752 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 195#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 190#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 191#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 192#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 196#L557-3 [2022-07-22 01:39:04,606 INFO L754 eck$LassoCheckResult]: Loop: 196#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 199#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 196#L557-3 [2022-07-22 01:39:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2022-07-22 01:39:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:04,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76921181] [2022-07-22 01:39:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:04,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:04,635 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:04,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2022-07-22 01:39:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:04,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787965417] [2022-07-22 01:39:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:04,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:04,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2022-07-22 01:39:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:04,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014627403] [2022-07-22 01:39:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:04,708 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:04,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:05,667 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:39:05,667 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:39:05,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:39:05,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:39:05,667 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:39:05,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:05,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:39:05,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:39:05,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration3_Lasso [2022-07-22 01:39:05,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:39:05,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:39:05,671 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 01:39:05,674 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 01:39:05,676 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 01:39:05,678 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 01:39:05,680 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 01:39:05,682 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 01:39:05,684 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 01:39:05,686 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 01:39:05,688 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 01:39:05,690 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 01:39:06,096 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 01:39:06,101 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 01:39:06,103 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 01:39:06,104 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 01:39:06,106 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 01:39:06,108 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 01:39:06,446 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:39:06,446 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:39:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,448 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 01:39:06,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 01:39:06,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:06,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:06,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:06,466 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 01:39:06,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:06,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,515 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 01:39:06,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:06,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:06,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:06,542 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 01:39:06,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 01:39:06,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,567 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 01:39:06,568 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 01:39:06,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:06,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:06,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:06,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:06,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,593 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 01:39:06,593 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 01:39:06,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:06,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:06,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:06,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:06,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,629 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 01:39:06,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:06,632 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 01:39:06,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:06,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:06,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:06,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,684 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 01:39:06,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,686 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 01:39:06,691 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 01:39:06,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:06,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:06,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:06,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:06,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,715 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 01:39:06,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,716 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 01:39:06,717 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 01:39:06,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 01:39:06,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:06,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:06,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,749 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 01:39:06,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,751 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 01:39:06,751 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 01:39:06,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:06,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:06,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:06,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:06,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,782 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 01:39:06,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,784 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 01:39:06,784 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 01:39:06,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:06,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:06,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:06,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:06,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:06,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,831 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 01:39:06,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:06,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:06,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:06,848 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 01:39:06,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,877 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 01:39:06,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,878 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 01:39:06,879 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 01:39:06,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:06,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:06,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:06,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,940 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 01:39:06,941 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 01:39:06,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:06,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:06,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:06,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:06,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:06,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:06,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:06,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:06,995 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 01:39:06,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:06,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:06,997 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 01:39:06,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:07,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:07,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:07,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:07,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:07,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:07,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:07,020 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 01:39:07,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:39:07,038 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-22 01:39:07,038 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-22 01:39:07,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:07,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:07,044 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 01:39:07,046 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 01:39:07,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:39:07,073 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:39:07,073 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:39:07,073 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2 Supporting invariants [] [2022-07-22 01:39:07,099 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 01:39:07,157 INFO L293 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-07-22 01:39:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:07,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:39:07,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:07,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:39:07,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:07,236 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 01:39:07,237 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:39:07,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:39:07,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 31 transitions. Complement of second has 7 states. [2022-07-22 01:39:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:39:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:39:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-07-22 01:39:07,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 01:39:07,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:07,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 01:39:07,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:07,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-22 01:39:07,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:07,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2022-07-22 01:39:07,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:07,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2022-07-22 01:39:07,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 01:39:07,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-22 01:39:07,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2022-07-22 01:39:07,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:07,262 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-07-22 01:39:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2022-07-22 01:39:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-07-22 01:39:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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 01:39:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-22 01:39:07,264 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 01:39:07,264 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 01:39:07,265 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:39:07,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-07-22 01:39:07,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:07,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:07,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:07,266 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:39:07,266 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:39:07,266 INFO L752 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 378#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 372#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 385#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 380#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 381#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 377#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 382#L557-4 [2022-07-22 01:39:07,266 INFO L754 eck$LassoCheckResult]: Loop: 382#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 368#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 369#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 373#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 374#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 382#L557-4 [2022-07-22 01:39:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:07,267 INFO L85 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2022-07-22 01:39:07,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:07,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798396610] [2022-07-22 01:39:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:07,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:07,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:07,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2022-07-22 01:39:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:07,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314921745] [2022-07-22 01:39:07,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:07,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:07,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2022-07-22 01:39:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:07,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345271058] [2022-07-22 01:39:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:07,349 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:07,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:07,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 01:39:08,322 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:39:08,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:39:08,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:39:08,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:39:08,323 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:39:08,323 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:08,323 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:39:08,323 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:39:08,323 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration4_Lasso [2022-07-22 01:39:08,323 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:39:08,323 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:39:08,326 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 01:39:08,328 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 01:39:08,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 01:39:08,333 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 01:39:08,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 01:39:08,337 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 01:39:08,340 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 01:39:08,341 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 01:39:08,343 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 01:39:08,346 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 01:39:08,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 01:39:08,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 01:39:08,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 01:39:08,792 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 01:39:08,793 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 01:39:08,795 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 01:39:09,141 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:39:09,142 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:39:09,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,148 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 01:39:09,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 01:39:09,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,179 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 01:39:09,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:09,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:09,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:09,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 01:39:09,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,205 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 01:39:09,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 01:39:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,273 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 01:39:09,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 01:39:09,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,326 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 01:39:09,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:09,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:09,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:09,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 01:39:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,354 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 01:39:09,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:09,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:09,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:09,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 01:39:09,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,382 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 01:39:09,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:09,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:09,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:09,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 01:39:09,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,419 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 01:39:09,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 01:39:09,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,447 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 01:39:09,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:09,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,516 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 01:39:09,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:39:09,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:09,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:09,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:09,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:09,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,547 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 01:39:09,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:09,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,597 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 01:39:09,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 01:39:09,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,643 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 01:39:09,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 01:39:09,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,677 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 01:39:09,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:09,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-22 01:39:09,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,707 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 01:39:09,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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 01:39:09,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:09,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:09,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:09,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:09,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:09,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:09,725 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:39:09,733 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-22 01:39:09,733 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 01:39:09,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:09,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:09,734 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:39:09,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 01:39:09,736 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:39:09,743 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:39:09,743 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:39:09,743 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3 Supporting invariants [] [2022-07-22 01:39:09,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-22 01:39:09,804 INFO L293 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-07-22 01:39:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:09,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:39:09,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:09,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:09,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 01:39:09,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:09,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-22 01:39:09,932 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-22 01:39:09,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-07-22 01:39:10,021 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 01:39:10,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-22 01:39:10,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 01:39:10,064 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 48 states and 58 transitions. Complement of second has 9 states. [2022-07-22 01:39:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:39:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 01:39:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-07-22 01:39:10,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2022-07-22 01:39:10,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:10,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 5 letters. [2022-07-22 01:39:10,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 10 letters. [2022-07-22 01:39:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:10,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2022-07-22 01:39:10,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:10,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 46 transitions. [2022-07-22 01:39:10,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-22 01:39:10,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 01:39:10,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2022-07-22 01:39:10,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:10,078 INFO L369 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-22 01:39:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2022-07-22 01:39:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-07-22 01:39:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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 01:39:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-22 01:39:10,085 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-22 01:39:10,085 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-22 01:39:10,085 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:39:10,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2022-07-22 01:39:10,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:39:10,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:10,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:10,087 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-07-22 01:39:10,087 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:39:10,087 INFO L752 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 596#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 605#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 609#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 603#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 604#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 607#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 624#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 625#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 601#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 602#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 606#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 614#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 612#L557-4 [2022-07-22 01:39:10,087 INFO L754 eck$LassoCheckResult]: Loop: 612#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 597#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 598#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 608#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 621#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 612#L557-4 [2022-07-22 01:39:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash -652525668, now seen corresponding path program 2 times [2022-07-22 01:39:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:10,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250488110] [2022-07-22 01:39:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 01:39:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:39:10,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250488110] [2022-07-22 01:39:10,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250488110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:39:10,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:39:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 01:39:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104752197] [2022-07-22 01:39:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:39:10,182 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:39:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 3 times [2022-07-22 01:39:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:10,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187843891] [2022-07-22 01:39:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:10,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:10,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:10,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:39:10,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 01:39:10,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 01:39:10,290 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 01:39:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:39:10,342 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-07-22 01:39:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 01:39:10,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2022-07-22 01:39:10,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 01:39:10,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 25 transitions. [2022-07-22 01:39:10,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-22 01:39:10,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 01:39:10,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2022-07-22 01:39:10,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:10,344 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-22 01:39:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2022-07-22 01:39:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-07-22 01:39:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 01:39:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-22 01:39:10,346 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 01:39:10,346 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 01:39:10,346 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:39:10,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-07-22 01:39:10,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 01:39:10,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:10,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:10,347 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:39:10,347 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-07-22 01:39:10,348 INFO L752 eck$LassoCheckResult]: Stem: 681#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 685#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 696#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 695#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 694#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 693#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 689#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 692#L557-4 [2022-07-22 01:39:10,348 INFO L754 eck$LassoCheckResult]: Loop: 692#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 683#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 684#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 686#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 687#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 691#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 697#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 692#L557-4 [2022-07-22 01:39:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 2 times [2022-07-22 01:39:10,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:10,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98649490] [2022-07-22 01:39:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:10,363 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:10,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:10,374 INFO L85 PathProgramCache]: Analyzing trace with hash -739883290, now seen corresponding path program 1 times [2022-07-22 01:39:10,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:10,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482821933] [2022-07-22 01:39:10,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:10,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:10,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:10,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash -891424489, now seen corresponding path program 3 times [2022-07-22 01:39:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:10,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098131787] [2022-07-22 01:39:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:39:10,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098131787] [2022-07-22 01:39:10,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098131787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:39:10,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419355710] [2022-07-22 01:39:10,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 01:39:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:39:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:10,512 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:39:10,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-07-22 01:39:10,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 01:39:10,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:39:10,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 01:39:10,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:10,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 01:39:10,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 01:39:10,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-22 01:39:10,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-07-22 01:39:10,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-07-22 01:39:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:10,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:39:23,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2022-07-22 01:39:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:23,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419355710] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:39:23,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:39:23,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2022-07-22 01:39:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769658231] [2022-07-22 01:39:23,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:39:23,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:39:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 01:39:23,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=440, Unknown=1, NotChecked=0, Total=552 [2022-07-22 01:39:23,450 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 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 01:39:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:39:23,673 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-22 01:39:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 01:39:23,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2022-07-22 01:39:23,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-22 01:39:23,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 22 transitions. [2022-07-22 01:39:23,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-22 01:39:23,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-22 01:39:23,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-07-22 01:39:23,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:23,675 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-22 01:39:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-07-22 01:39:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-22 01:39:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 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 01:39:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-22 01:39:23,677 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-22 01:39:23,677 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-22 01:39:23,677 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:39:23,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-07-22 01:39:23,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-22 01:39:23,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:23,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:23,678 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2022-07-22 01:39:23,678 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2022-07-22 01:39:23,678 INFO L752 eck$LassoCheckResult]: Stem: 845#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 853#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 854#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 855#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 856#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 849#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 850#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 851#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 852#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 857#L557-4 [2022-07-22 01:39:23,678 INFO L754 eck$LassoCheckResult]: Loop: 857#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 847#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 848#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 863#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 862#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 861#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 860#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 858#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 859#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 857#L557-4 [2022-07-22 01:39:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 765528213, now seen corresponding path program 3 times [2022-07-22 01:39:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:23,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347641039] [2022-07-22 01:39:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:23,707 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:23,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:23,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1936731915, now seen corresponding path program 2 times [2022-07-22 01:39:23,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:23,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726181001] [2022-07-22 01:39:23,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:23,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:23,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:23,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1863480073, now seen corresponding path program 4 times [2022-07-22 01:39:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:23,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031389505] [2022-07-22 01:39:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:39:24,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031389505] [2022-07-22 01:39:24,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031389505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:39:24,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490671133] [2022-07-22 01:39:24,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 01:39:24,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:39:24,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:24,096 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:39:24,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-07-22 01:39:24,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 01:39:24,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:39:24,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 01:39:24,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:24,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-22 01:39:24,331 INFO L356 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-07-22 01:39:24,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 32 [2022-07-22 01:39:24,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-07-22 01:39:24,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2022-07-22 01:39:24,730 INFO L356 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-07-22 01:39:24,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2022-07-22 01:39:24,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-22 01:39:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:24,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:39:26,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2022-07-22 01:39:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:26,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490671133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:39:26,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:39:26,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 35 [2022-07-22 01:39:26,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213528481] [2022-07-22 01:39:26,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:39:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:39:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-22 01:39:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 01:39:26,480 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 35 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 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 01:39:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:39:27,105 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-07-22 01:39:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 01:39:27,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2022-07-22 01:39:27,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-07-22 01:39:27,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 26 transitions. [2022-07-22 01:39:27,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 01:39:27,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-22 01:39:27,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2022-07-22 01:39:27,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:27,108 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-22 01:39:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2022-07-22 01:39:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-07-22 01:39:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 22 states have internal predecessors, (25), 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 01:39:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-22 01:39:27,110 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-22 01:39:27,110 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-22 01:39:27,110 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:39:27,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2022-07-22 01:39:27,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-07-22 01:39:27,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:27,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:27,111 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1] [2022-07-22 01:39:27,111 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2022-07-22 01:39:27,111 INFO L752 eck$LassoCheckResult]: Stem: 1063#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1064#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1071#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1085#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1083#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1081#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1080#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1079#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1069#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1070#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1073#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1075#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1074#L557-4 [2022-07-22 01:39:27,111 INFO L754 eck$LassoCheckResult]: Loop: 1074#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1065#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1066#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1067#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1068#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1072#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1084#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1082#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1078#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1076#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1077#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1074#L557-4 [2022-07-22 01:39:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1233207546, now seen corresponding path program 4 times [2022-07-22 01:39:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:27,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915617052] [2022-07-22 01:39:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:27,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:27,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:27,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1478533616, now seen corresponding path program 3 times [2022-07-22 01:39:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:27,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832834032] [2022-07-22 01:39:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:27,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:27,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:27,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1457439913, now seen corresponding path program 5 times [2022-07-22 01:39:27,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:27,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628647265] [2022-07-22 01:39:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:27,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:39:27,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628647265] [2022-07-22 01:39:27,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628647265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:39:27,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695820243] [2022-07-22 01:39:27,714 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 01:39:27,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:39:27,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:27,719 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:39:27,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-07-22 01:39:27,835 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-22 01:39:27,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:39:27,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 01:39:27,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:27,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-22 01:39:27,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-22 01:39:28,030 INFO L356 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-07-22 01:39:28,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 32 [2022-07-22 01:39:28,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-07-22 01:39:28,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2022-07-22 01:39:28,447 INFO L356 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-07-22 01:39:28,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2022-07-22 01:39:28,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-22 01:39:28,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-22 01:39:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:28,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:42:04,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2022-07-22 01:42:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:42:04,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695820243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:42:04,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:42:04,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 44 [2022-07-22 01:42:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366142656] [2022-07-22 01:42:04,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:42:05,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:42:05,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-22 01:42:05,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1556, Unknown=13, NotChecked=0, Total=1892 [2022-07-22 01:42:05,290 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 4 Second operand has 44 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 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 01:42:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:42:06,684 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-07-22 01:42:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 01:42:06,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 41 transitions. [2022-07-22 01:42:06,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:42:06,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 30 transitions. [2022-07-22 01:42:06,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 01:42:06,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 01:42:06,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2022-07-22 01:42:06,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:42:06,687 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-07-22 01:42:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2022-07-22 01:42:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-22 01:42:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 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 01:42:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-22 01:42:06,689 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-22 01:42:06,689 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-22 01:42:06,690 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 01:42:06,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2022-07-22 01:42:06,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:42:06,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:42:06,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:42:06,691 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1] [2022-07-22 01:42:06,691 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2022-07-22 01:42:06,691 INFO L752 eck$LassoCheckResult]: Stem: 1332#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1340#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1343#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1344#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1341#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1336#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1337#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1358#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1342#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1338#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1339#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1347#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1346#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1345#L557-4 [2022-07-22 01:42:06,691 INFO L754 eck$LassoCheckResult]: Loop: 1345#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1334#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1335#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1357#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1356#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1355#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1354#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1353#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1352#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1351#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1350#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1348#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1349#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1345#L557-4 [2022-07-22 01:42:06,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:42:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash -298519521, now seen corresponding path program 5 times [2022-07-22 01:42:06,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:42:06,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776781929] [2022-07-22 01:42:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:42:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:42:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:42:06,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:42:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:42:06,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:42:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:42:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash -763367531, now seen corresponding path program 4 times [2022-07-22 01:42:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:42:06,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606704611] [2022-07-22 01:42:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:42:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:42:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:42:06,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:42:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:42:06,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:42:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:42:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1962220599, now seen corresponding path program 6 times [2022-07-22 01:42:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:42:06,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137472062] [2022-07-22 01:42:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:42:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:42:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:42:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:42:07,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:42:07,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137472062] [2022-07-22 01:42:07,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137472062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:42:07,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79444447] [2022-07-22 01:42:07,585 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 01:42:07,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:42:07,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:42:07,589 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:42:07,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-07-22 01:42:07,713 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-22 01:42:07,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:42:07,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-22 01:42:07,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:42:07,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-22 01:42:07,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-22 01:42:07,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-22 01:42:08,025 INFO L356 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-07-22 01:42:08,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 32 [2022-07-22 01:42:08,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-07-22 01:42:08,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2022-07-22 01:42:08,599 INFO L356 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-07-22 01:42:08,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2022-07-22 01:42:08,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-22 01:42:08,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-22 01:42:08,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-22 01:42:08,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-22 01:42:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:42:09,021 INFO L328 TraceCheckSpWp]: Computing backward predicates...