./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ae007674 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/Toulouse-MultiBranchesToLoop-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 d2e8c7278f9710711a8ba5cefeb9f745a5377c275c5c72390d2d78403afcf1c7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 09:08:38,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 09:08:38,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 09:08:38,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 09:08:38,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 09:08:38,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 09:08:38,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 09:08:38,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 09:08:38,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 09:08:38,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 09:08:38,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 09:08:38,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 09:08:38,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 09:08:38,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 09:08:38,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 09:08:38,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 09:08:38,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 09:08:38,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 09:08:38,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 09:08:38,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 09:08:38,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 09:08:38,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 09:08:38,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 09:08:38,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 09:08:38,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 09:08:38,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 09:08:38,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 09:08:38,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 09:08:38,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 09:08:38,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 09:08:38,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 09:08:38,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 09:08:38,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 09:08:38,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 09:08:38,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 09:08:38,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 09:08:38,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 09:08:38,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 09:08:38,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 09:08:38,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 09:08:38,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 09:08:38,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-28 09:08:38,384 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 09:08:38,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 09:08:38,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 09:08:38,387 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 09:08:38,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 09:08:38,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 09:08:38,390 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 09:08:38,390 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-28 09:08:38,390 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-28 09:08:38,390 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-28 09:08:38,390 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-28 09:08:38,391 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-28 09:08:38,391 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-28 09:08:38,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 09:08:38,392 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 09:08:38,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 09:08:38,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 09:08:38,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-28 09:08:38,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-28 09:08:38,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-28 09:08:38,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 09:08:38,393 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-28 09:08:38,393 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 09:08:38,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-28 09:08:38,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 09:08:38,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 09:08:38,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 09:08:38,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 09:08:38,395 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-28 09:08:38,395 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 -> d2e8c7278f9710711a8ba5cefeb9f745a5377c275c5c72390d2d78403afcf1c7 [2021-12-28 09:08:38,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 09:08:38,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 09:08:38,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 09:08:38,655 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 09:08:38,667 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 09:08:38,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2021-12-28 09:08:38,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8f1d11c/d42ff2ffcde749f3b53c8e0d7838133c/FLAGb60a48088 [2021-12-28 09:08:39,138 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 09:08:39,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2021-12-28 09:08:39,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8f1d11c/d42ff2ffcde749f3b53c8e0d7838133c/FLAGb60a48088 [2021-12-28 09:08:39,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8f1d11c/d42ff2ffcde749f3b53c8e0d7838133c [2021-12-28 09:08:39,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 09:08:39,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 09:08:39,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 09:08:39,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 09:08:39,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 09:08:39,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242e6677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39, skipping insertion in model container [2021-12-28 09:08:39,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 09:08:39,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 09:08:39,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:08:39,350 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 09:08:39,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:08:39,406 INFO L208 MainTranslator]: Completed translation [2021-12-28 09:08:39,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39 WrapperNode [2021-12-28 09:08:39,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 09:08:39,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 09:08:39,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 09:08:39,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 09:08:39,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,433 INFO L137 Inliner]: procedures = 110, calls = 67, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2021-12-28 09:08:39,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 09:08:39,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 09:08:39,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 09:08:39,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 09:08:39,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 09:08:39,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 09:08:39,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 09:08:39,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 09:08:39,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (1/1) ... [2021-12-28 09:08:39,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:39,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:39,489 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) [2021-12-28 09:08:39,494 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 [2021-12-28 09:08:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 09:08:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 09:08:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 09:08:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 09:08:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 09:08:39,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 09:08:39,575 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 09:08:39,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 09:08:39,729 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 09:08:39,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 09:08:39,734 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 09:08:39,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:08:39 BoogieIcfgContainer [2021-12-28 09:08:39,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 09:08:39,736 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-28 09:08:39,736 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-28 09:08:39,738 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-28 09:08:39,738 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:08:39,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.12 09:08:39" (1/3) ... [2021-12-28 09:08:39,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@221562f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:08:39, skipping insertion in model container [2021-12-28 09:08:39,739 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:08:39,739 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:39" (2/3) ... [2021-12-28 09:08:39,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@221562f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:08:39, skipping insertion in model container [2021-12-28 09:08:39,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:08:39,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:08:39" (3/3) ... [2021-12-28 09:08:39,744 INFO L388 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2021-12-28 09:08:39,771 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-28 09:08:39,771 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-28 09:08:39,772 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-28 09:08:39,776 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-28 09:08:39,777 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-28 09:08:39,777 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-28 09:08:39,777 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-28 09:08:39,777 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-28 09:08:39,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 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) [2021-12-28 09:08:39,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:39,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:39,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:39,807 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:39,807 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:39,807 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-28 09:08:39,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 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) [2021-12-28 09:08:39,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:39,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:39,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:39,813 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:39,813 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:39,819 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 10#L553true assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 4#L553-2true call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 23#L558true assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 19#L558-2true call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 24#L563true assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 20#L563-2true call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 27#L568true assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 26#L568-2true call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 15#L573true assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 8#L573-2true call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 12#L578true assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 16#L578-2true call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 21#L583true assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 25#L583-2true call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 18#L588true assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 7#L588-2true call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 9#L593true assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 17#L598-4true [2021-12-28 09:08:39,819 INFO L793 eck$LassoCheckResult]: Loop: 17#L598-4true call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 13#L598true assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 22#L598-2true assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 17#L598-4true [2021-12-28 09:08:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2021-12-28 09:08:39,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:39,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523095672] [2021-12-28 09:08:39,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:39,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:40,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:40,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523095672] [2021-12-28 09:08:40,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523095672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:40,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:40,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 09:08:40,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563234934] [2021-12-28 09:08:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:40,260 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2021-12-28 09:08:40,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:40,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504224361] [2021-12-28 09:08:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:40,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:40,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:40,319 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:40,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:40,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 09:08:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-28 09:08:40,504 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 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) Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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) [2021-12-28 09:08:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:40,856 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2021-12-28 09:08:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 09:08:40,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 112 transitions. [2021-12-28 09:08:40,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:40,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 66 states and 92 transitions. [2021-12-28 09:08:40,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-12-28 09:08:40,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-12-28 09:08:40,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2021-12-28 09:08:40,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:40,874 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 92 transitions. [2021-12-28 09:08:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2021-12-28 09:08:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 34. [2021-12-28 09:08:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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) [2021-12-28 09:08:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2021-12-28 09:08:40,891 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2021-12-28 09:08:40,891 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2021-12-28 09:08:40,891 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-28 09:08:40,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2021-12-28 09:08:40,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:40,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:40,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:40,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:40,892 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:40,893 INFO L791 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 146#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 151#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 155#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 144#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 145#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 147#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 148#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 162#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 134#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 135#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 150#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 136#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 137#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 153#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 142#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 143#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 149#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 138#L598-4 [2021-12-28 09:08:40,893 INFO L793 eck$LassoCheckResult]: Loop: 138#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 139#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 154#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 138#L598-4 [2021-12-28 09:08:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1775784008, now seen corresponding path program 1 times [2021-12-28 09:08:40,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:40,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299224618] [2021-12-28 09:08:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:40,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:40,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:40,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299224618] [2021-12-28 09:08:40,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299224618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:40,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:40,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 09:08:40,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317125236] [2021-12-28 09:08:40,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:40,931 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2021-12-28 09:08:40,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:40,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138796238] [2021-12-28 09:08:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:40,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:40,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:40,967 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:41,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:41,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 09:08:41,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 09:08:41,131 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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) [2021-12-28 09:08:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:41,172 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-12-28 09:08:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 09:08:41,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2021-12-28 09:08:41,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:41,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 45 transitions. [2021-12-28 09:08:41,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-12-28 09:08:41,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-12-28 09:08:41,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2021-12-28 09:08:41,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:41,174 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-28 09:08:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2021-12-28 09:08:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-28 09:08:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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) [2021-12-28 09:08:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-12-28 09:08:41,178 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-28 09:08:41,178 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-28 09:08:41,178 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-28 09:08:41,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2021-12-28 09:08:41,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:41,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:41,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:41,179 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:41,179 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:41,179 INFO L791 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 224#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 229#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 242#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 241#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 240#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 238#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 236#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 237#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 239#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 212#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 235#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 232#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 234#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 230#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 218#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 219#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 227#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 216#L598-4 [2021-12-28 09:08:41,179 INFO L793 eck$LassoCheckResult]: Loop: 216#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 217#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 231#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 216#L598-4 [2021-12-28 09:08:41,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1239319610, now seen corresponding path program 1 times [2021-12-28 09:08:41,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:41,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758390115] [2021-12-28 09:08:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:41,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:41,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:41,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758390115] [2021-12-28 09:08:41,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758390115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:41,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:41,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 09:08:41,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348663407] [2021-12-28 09:08:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:41,255 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2021-12-28 09:08:41,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:41,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11326004] [2021-12-28 09:08:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:41,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:41,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:41,276 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:41,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:41,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 09:08:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 09:08:41,411 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 12 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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) [2021-12-28 09:08:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:41,561 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2021-12-28 09:08:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:08:41,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2021-12-28 09:08:41,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:41,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2021-12-28 09:08:41,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-12-28 09:08:41,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-12-28 09:08:41,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2021-12-28 09:08:41,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:41,576 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-12-28 09:08:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2021-12-28 09:08:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-12-28 09:08:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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) [2021-12-28 09:08:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-12-28 09:08:41,579 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-28 09:08:41,579 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-12-28 09:08:41,580 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-28 09:08:41,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2021-12-28 09:08:41,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:41,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:41,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:41,583 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:41,583 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:41,584 INFO L791 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 318#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 312#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 313#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 334#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 332#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 319#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 320#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 330#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 306#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 307#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 322#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 328#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 331#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 324#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 314#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 315#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 321#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 310#L598-4 [2021-12-28 09:08:41,584 INFO L793 eck$LassoCheckResult]: Loop: 310#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 311#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 325#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 310#L598-4 [2021-12-28 09:08:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:41,585 INFO L85 PathProgramCache]: Analyzing trace with hash -652513596, now seen corresponding path program 1 times [2021-12-28 09:08:41,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:41,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853194051] [2021-12-28 09:08:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:41,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:41,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:41,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853194051] [2021-12-28 09:08:41,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853194051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:41,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:41,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 09:08:41,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710278391] [2021-12-28 09:08:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:41,727 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2021-12-28 09:08:41,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:41,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548690272] [2021-12-28 09:08:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:41,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:41,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:41,761 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:41,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 09:08:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-28 09:08:41,881 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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) [2021-12-28 09:08:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:41,969 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2021-12-28 09:08:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:08:41,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2021-12-28 09:08:41,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:41,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2021-12-28 09:08:41,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-28 09:08:41,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-28 09:08:41,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2021-12-28 09:08:41,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:41,971 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2021-12-28 09:08:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2021-12-28 09:08:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-12-28 09:08:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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) [2021-12-28 09:08:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-12-28 09:08:41,975 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-28 09:08:41,975 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-28 09:08:41,975 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-28 09:08:41,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-12-28 09:08:41,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:41,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:41,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:41,976 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:41,976 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:41,977 INFO L791 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 396#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 410#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 406#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 407#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 418#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 420#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 411#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 412#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 426#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 425#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 400#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 424#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 419#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 423#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 417#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 404#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 405#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 413#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 397#L598-4 [2021-12-28 09:08:41,977 INFO L793 eck$LassoCheckResult]: Loop: 397#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 398#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 416#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 397#L598-4 [2021-12-28 09:08:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1353578174, now seen corresponding path program 1 times [2021-12-28 09:08:41,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991497377] [2021-12-28 09:08:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:41,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:42,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:42,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991497377] [2021-12-28 09:08:42,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991497377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:42,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:42,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 09:08:42,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766352232] [2021-12-28 09:08:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:42,049 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:42,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2021-12-28 09:08:42,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:42,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852924723] [2021-12-28 09:08:42,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:42,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:42,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:42,079 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:42,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:42,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 09:08:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 09:08:42,200 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2021-12-28 09:08:42,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:42,275 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-28 09:08:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:08:42,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-12-28 09:08:42,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:42,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2021-12-28 09:08:42,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-28 09:08:42,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-28 09:08:42,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2021-12-28 09:08:42,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:42,277 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2021-12-28 09:08:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2021-12-28 09:08:42,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-12-28 09:08:42,279 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) [2021-12-28 09:08:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2021-12-28 09:08:42,279 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-12-28 09:08:42,279 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-12-28 09:08:42,279 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-28 09:08:42,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2021-12-28 09:08:42,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:42,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:42,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:42,280 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:42,280 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:42,280 INFO L791 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 500#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 504#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 515#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 514#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 512#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 513#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 517#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 516#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 486#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 487#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 511#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 507#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 510#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 505#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 492#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 493#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 501#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 490#L598-4 [2021-12-28 09:08:42,280 INFO L793 eck$LassoCheckResult]: Loop: 490#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 491#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 506#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 490#L598-4 [2021-12-28 09:08:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2033636544, now seen corresponding path program 1 times [2021-12-28 09:08:42,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:42,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704076949] [2021-12-28 09:08:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:42,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:42,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:42,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704076949] [2021-12-28 09:08:42,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704076949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:42,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:42,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 09:08:42,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135128282] [2021-12-28 09:08:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:42,358 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:42,359 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2021-12-28 09:08:42,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:42,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297238226] [2021-12-28 09:08:42,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:42,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:42,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:42,372 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:42,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 09:08:42,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 09:08:42,524 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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) [2021-12-28 09:08:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:42,636 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2021-12-28 09:08:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 09:08:42,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 67 transitions. [2021-12-28 09:08:42,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:42,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 67 transitions. [2021-12-28 09:08:42,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-12-28 09:08:42,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-12-28 09:08:42,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2021-12-28 09:08:42,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:42,639 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2021-12-28 09:08:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2021-12-28 09:08:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2021-12-28 09:08:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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) [2021-12-28 09:08:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-12-28 09:08:42,641 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-12-28 09:08:42,641 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-12-28 09:08:42,642 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-28 09:08:42,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2021-12-28 09:08:42,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:42,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:42,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:42,643 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:42,643 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:42,643 INFO L791 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 595#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 600#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 604#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 593#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 594#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 596#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 597#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 611#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 583#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 584#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 599#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 585#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 586#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 602#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 591#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 592#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 598#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 587#L598-4 [2021-12-28 09:08:42,643 INFO L793 eck$LassoCheckResult]: Loop: 587#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 588#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 603#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 587#L598-4 [2021-12-28 09:08:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash 486323390, now seen corresponding path program 1 times [2021-12-28 09:08:42,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:42,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116551373] [2021-12-28 09:08:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:42,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:42,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:42,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116551373] [2021-12-28 09:08:42,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116551373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:42,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:42,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 09:08:42,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386356646] [2021-12-28 09:08:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:42,747 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2021-12-28 09:08:42,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:42,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501832361] [2021-12-28 09:08:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:42,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:42,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:42,794 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:42,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 09:08:42,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-28 09:08:42,931 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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) [2021-12-28 09:08:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:43,026 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-12-28 09:08:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 09:08:43,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2021-12-28 09:08:43,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:43,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 59 transitions. [2021-12-28 09:08:43,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-12-28 09:08:43,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-12-28 09:08:43,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 59 transitions. [2021-12-28 09:08:43,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:43,028 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2021-12-28 09:08:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 59 transitions. [2021-12-28 09:08:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2021-12-28 09:08:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2021-12-28 09:08:43,030 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2021-12-28 09:08:43,030 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2021-12-28 09:08:43,030 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-28 09:08:43,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2021-12-28 09:08:43,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:43,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:43,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:43,031 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:43,031 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:43,031 INFO L791 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 697#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 700#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 720#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 719#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 718#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 717#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 716#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 715#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 683#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 684#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 699#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 685#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 686#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 701#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 689#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 690#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 698#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 687#L598-4 [2021-12-28 09:08:43,031 INFO L793 eck$LassoCheckResult]: Loop: 687#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 688#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 702#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 687#L598-4 [2021-12-28 09:08:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2021-12-28 09:08:43,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:43,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694056497] [2021-12-28 09:08:43,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:43,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:43,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694056497] [2021-12-28 09:08:43,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694056497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:43,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:43,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 09:08:43,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484227440] [2021-12-28 09:08:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:43,111 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:43,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2021-12-28 09:08:43,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:43,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283414035] [2021-12-28 09:08:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:43,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:43,117 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:43,136 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:43,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:43,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 09:08:43,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 09:08:43,290 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2021-12-28 09:08:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:43,351 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-28 09:08:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:08:43,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2021-12-28 09:08:43,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:43,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 54 transitions. [2021-12-28 09:08:43,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-28 09:08:43,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-12-28 09:08:43,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2021-12-28 09:08:43,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:43,353 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-12-28 09:08:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2021-12-28 09:08:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2021-12-28 09:08:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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) [2021-12-28 09:08:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2021-12-28 09:08:43,355 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-12-28 09:08:43,355 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-12-28 09:08:43,355 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-28 09:08:43,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2021-12-28 09:08:43,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:43,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:43,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:43,356 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:43,356 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:43,356 INFO L791 eck$LassoCheckResult]: Stem: 774#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 788#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 782#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 783#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 786#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 787#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 789#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 790#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 800#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 778#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 779#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 793#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 780#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 781#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 797#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 784#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 785#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 794#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 776#L598-4 [2021-12-28 09:08:43,356 INFO L793 eck$LassoCheckResult]: Loop: 776#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 777#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 796#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 776#L598-4 [2021-12-28 09:08:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2021-12-28 09:08:43,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:43,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591111665] [2021-12-28 09:08:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:43,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:43,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:43,384 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:43,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:43,385 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2021-12-28 09:08:43,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:43,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596184185] [2021-12-28 09:08:43,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:43,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:43,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:43,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2021-12-28 09:08:43,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:43,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013001552] [2021-12-28 09:08:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:43,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:43,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:43,450 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:48,056 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:08:48,056 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:08:48,056 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:08:48,057 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:08:48,057 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:08:48,057 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:48,057 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:08:48,057 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:08:48,057 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration9_Lasso [2021-12-28 09:08:48,057 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:08:48,057 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:08:48,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:48,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:49,279 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:08:49,282 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:08:49,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,284 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) [2021-12-28 09:08:49,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,340 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 [2021-12-28 09:08:49,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-28 09:08:49,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,347 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) [2021-12-28 09:08:49,351 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 [2021-12-28 09:08:49,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,390 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 [2021-12-28 09:08:49,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,391 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) [2021-12-28 09:08:49,392 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 [2021-12-28 09:08:49,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,434 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 [2021-12-28 09:08:49,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,437 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) [2021-12-28 09:08:49,438 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 [2021-12-28 09:08:49,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,462 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 [2021-12-28 09:08:49,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,464 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) [2021-12-28 09:08:49,465 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 [2021-12-28 09:08:49,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,502 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 [2021-12-28 09:08:49,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,504 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) [2021-12-28 09:08:49,504 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 [2021-12-28 09:08:49,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,536 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 [2021-12-28 09:08:49,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,537 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) [2021-12-28 09:08:49,539 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 [2021-12-28 09:08:49,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 [2021-12-28 09:08:49,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,592 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 [2021-12-28 09:08:49,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,593 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) [2021-12-28 09:08:49,597 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 [2021-12-28 09:08:49,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:49,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:49,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,637 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 [2021-12-28 09:08:49,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,639 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) [2021-12-28 09:08:49,640 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 [2021-12-28 09:08:49,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:49,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,681 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) [2021-12-28 09:08:49,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,695 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 [2021-12-28 09:08:49,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,719 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 [2021-12-28 09:08:49,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,720 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) [2021-12-28 09:08:49,721 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 [2021-12-28 09:08:49,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-28 09:08:49,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,760 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) [2021-12-28 09:08:49,761 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 [2021-12-28 09:08:49,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,799 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 [2021-12-28 09:08:49,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,801 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) [2021-12-28 09:08:49,802 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 [2021-12-28 09:08:49,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-28 09:08:49,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,841 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) [2021-12-28 09:08:49,841 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 [2021-12-28 09:08:49,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,882 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 [2021-12-28 09:08:49,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,883 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) [2021-12-28 09:08:49,884 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 [2021-12-28 09:08:49,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:49,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,912 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) [2021-12-28 09:08:49,913 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 [2021-12-28 09:08:49,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:49,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:49,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,941 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 [2021-12-28 09:08:49,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,942 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) [2021-12-28 09:08:49,943 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 [2021-12-28 09:08:49,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:49,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-28 09:08:49,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:49,971 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) [2021-12-28 09:08:49,972 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 [2021-12-28 09:08:49,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:49,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:49,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:49,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:49,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:49,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:49,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:49,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:49,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-28 09:08:50,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,012 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) [2021-12-28 09:08:50,013 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 [2021-12-28 09:08:50,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,046 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 [2021-12-28 09:08:50,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,048 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) [2021-12-28 09:08:50,049 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 [2021-12-28 09:08:50,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,084 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 [2021-12-28 09:08:50,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,085 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) [2021-12-28 09:08:50,087 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 [2021-12-28 09:08:50,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-28 09:08:50,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,122 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) [2021-12-28 09:08:50,123 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 [2021-12-28 09:08:50,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,158 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 [2021-12-28 09:08:50,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,159 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) [2021-12-28 09:08:50,159 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 [2021-12-28 09:08:50,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,200 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 [2021-12-28 09:08:50,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,202 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) [2021-12-28 09:08:50,203 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 [2021-12-28 09:08:50,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,237 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) [2021-12-28 09:08:50,238 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 [2021-12-28 09:08:50,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,278 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 [2021-12-28 09:08:50,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,279 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) [2021-12-28 09:08:50,280 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 [2021-12-28 09:08:50,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-28 09:08:50,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,305 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) [2021-12-28 09:08:50,306 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 [2021-12-28 09:08:50,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,332 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) [2021-12-28 09:08:50,333 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 [2021-12-28 09:08:50,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,361 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) [2021-12-28 09:08:50,362 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 [2021-12-28 09:08:50,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,401 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 [2021-12-28 09:08:50,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,402 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) [2021-12-28 09:08:50,403 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 [2021-12-28 09:08:50,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,442 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) [2021-12-28 09:08:50,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,455 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 [2021-12-28 09:08:50,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:50,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:50,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:50,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,480 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 [2021-12-28 09:08:50,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,482 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) [2021-12-28 09:08:50,483 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 [2021-12-28 09:08:50,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,538 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) [2021-12-28 09:08:50,539 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 [2021-12-28 09:08:50,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 [2021-12-28 09:08:50,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,582 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 [2021-12-28 09:08:50,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,583 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) [2021-12-28 09:08:50,584 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 [2021-12-28 09:08:50,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,622 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 [2021-12-28 09:08:50,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,623 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) [2021-12-28 09:08:50,624 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 [2021-12-28 09:08:50,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,671 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 [2021-12-28 09:08:50,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,683 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) [2021-12-28 09:08:50,684 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 [2021-12-28 09:08:50,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,727 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) [2021-12-28 09:08:50,728 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 [2021-12-28 09:08:50,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,776 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) [2021-12-28 09:08:50,777 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 [2021-12-28 09:08:50,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,814 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) [2021-12-28 09:08:50,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,829 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 [2021-12-28 09:08:50,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:50,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:50,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,855 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) [2021-12-28 09:08:50,856 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 [2021-12-28 09:08:50,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:50,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:50,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:50,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:50,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:50,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:50,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:50,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:08:50,909 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-28 09:08:50,909 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-28 09:08:50,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:50,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:50,928 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) [2021-12-28 09:08:50,929 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 [2021-12-28 09:08:50,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:08:50,952 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-28 09:08:50,952 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:08:50,953 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1 + 100 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 - 2 >= 0] [2021-12-28 09:08:50,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:51,064 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2021-12-28 09:08:51,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:51,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-28 09:08:51,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:51,180 INFO L387 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 14 treesize of output 12 [2021-12-28 09:08:51,259 INFO L387 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 [2021-12-28 09:08:51,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:51,340 INFO L387 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 [2021-12-28 09:08:51,390 INFO L387 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 [2021-12-28 09:08:51,447 INFO L387 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 [2021-12-28 09:08:51,499 INFO L387 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 [2021-12-28 09:08:51,550 INFO L387 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 [2021-12-28 09:08:51,595 INFO L387 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 [2021-12-28 09:08:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:51,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 09:08:51,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:51,738 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2021-12-28 09:08:51,738 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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) [2021-12-28 09:08:52,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 9. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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 57 states and 69 transitions. Complement of second has 17 states. [2021-12-28 09:08:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-28 09:08:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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) [2021-12-28 09:08:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2021-12-28 09:08:52,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 3 letters. [2021-12-28 09:08:52,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:52,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-28 09:08:52,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:52,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 6 letters. [2021-12-28 09:08:52,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:52,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2021-12-28 09:08:52,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-28 09:08:52,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 33 states and 42 transitions. [2021-12-28 09:08:52,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-28 09:08:52,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-28 09:08:52,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2021-12-28 09:08:52,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:52,010 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2021-12-28 09:08:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2021-12-28 09:08:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-12-28 09:08:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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) [2021-12-28 09:08:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-28 09:08:52,011 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-28 09:08:52,011 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-28 09:08:52,011 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-28 09:08:52,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2021-12-28 09:08:52,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:52,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:52,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:52,012 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:52,012 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:52,012 INFO L791 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1178#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1172#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1173#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1174#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1175#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1176#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1177#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1185#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1164#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1165#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1180#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1167#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1168#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1184#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1169#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1170#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1181#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1162#L598-4 [2021-12-28 09:08:52,012 INFO L793 eck$LassoCheckResult]: Loop: 1162#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1163#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1182#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1162#L598-4 [2021-12-28 09:08:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash -492624188, now seen corresponding path program 1 times [2021-12-28 09:08:52,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:52,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869669578] [2021-12-28 09:08:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:52,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:52,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:52,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869669578] [2021-12-28 09:08:52,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869669578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:52,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:52,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:08:52,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511259009] [2021-12-28 09:08:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:52,048 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2021-12-28 09:08:52,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:52,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655981580] [2021-12-28 09:08:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:52,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:52,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:52,060 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:52,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 09:08:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 09:08:52,213 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-12-28 09:08:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:52,289 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-28 09:08:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 09:08:52,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2021-12-28 09:08:52,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:52,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2021-12-28 09:08:52,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-12-28 09:08:52,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-12-28 09:08:52,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2021-12-28 09:08:52,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:52,291 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-12-28 09:08:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2021-12-28 09:08:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2021-12-28 09:08:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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) [2021-12-28 09:08:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-28 09:08:52,293 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-28 09:08:52,293 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-28 09:08:52,293 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-28 09:08:52,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2021-12-28 09:08:52,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:52,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:52,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:52,294 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:52,294 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:52,294 INFO L791 eck$LassoCheckResult]: Stem: 1235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1251#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1247#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1248#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1249#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1250#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1252#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1253#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1259#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1239#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1240#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1255#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 1262#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1261#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1256#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1244#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1245#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1254#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1237#L598-4 [2021-12-28 09:08:52,294 INFO L793 eck$LassoCheckResult]: Loop: 1237#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1238#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1257#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1237#L598-4 [2021-12-28 09:08:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2027335746, now seen corresponding path program 1 times [2021-12-28 09:08:52,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:52,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237776600] [2021-12-28 09:08:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:52,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:52,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:52,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237776600] [2021-12-28 09:08:52,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237776600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:52,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:52,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:08:52,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485010088] [2021-12-28 09:08:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:52,325 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2021-12-28 09:08:52,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:52,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407631645] [2021-12-28 09:08:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:52,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:52,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:52,336 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:52,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:52,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 09:08:52,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 09:08:52,516 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2021-12-28 09:08:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:52,580 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2021-12-28 09:08:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:08:52,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2021-12-28 09:08:52,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:52,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2021-12-28 09:08:52,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-28 09:08:52,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-28 09:08:52,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2021-12-28 09:08:52,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:52,582 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-28 09:08:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2021-12-28 09:08:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2021-12-28 09:08:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 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) [2021-12-28 09:08:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-28 09:08:52,583 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-28 09:08:52,584 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-28 09:08:52,584 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-28 09:08:52,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2021-12-28 09:08:52,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:52,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:52,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:52,584 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:52,584 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:52,585 INFO L791 eck$LassoCheckResult]: Stem: 1300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1315#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1311#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1312#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1313#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1314#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1316#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1317#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1323#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1302#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1303#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1319#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1304#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1305#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1321#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1308#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1309#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1320#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1306#L598-4 [2021-12-28 09:08:52,585 INFO L793 eck$LassoCheckResult]: Loop: 1306#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1307#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1322#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1306#L598-4 [2021-12-28 09:08:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash 189281224, now seen corresponding path program 1 times [2021-12-28 09:08:52,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:52,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587005114] [2021-12-28 09:08:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:52,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:52,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:52,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587005114] [2021-12-28 09:08:52,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587005114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:52,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:52,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 09:08:52,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642667691] [2021-12-28 09:08:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:52,711 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2021-12-28 09:08:52,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:52,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410441422] [2021-12-28 09:08:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:52,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:52,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:52,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:52,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 09:08:52,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-12-28 09:08:52,885 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 4 Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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) [2021-12-28 09:08:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:52,971 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-28 09:08:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 09:08:52,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2021-12-28 09:08:52,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:52,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2021-12-28 09:08:52,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-28 09:08:52,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-28 09:08:52,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2021-12-28 09:08:52,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:52,972 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-28 09:08:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2021-12-28 09:08:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2021-12-28 09:08:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-12-28 09:08:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-28 09:08:52,973 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-28 09:08:52,974 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-28 09:08:52,974 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-28 09:08:52,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2021-12-28 09:08:52,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:52,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:52,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:52,974 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:52,974 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:52,975 INFO L791 eck$LassoCheckResult]: Stem: 1369#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1385#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1377#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1378#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1381#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1382#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1383#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1384#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1390#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1371#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1372#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1387#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1373#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1374#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1388#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1379#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 1380#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1386#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 1375#L598-4 [2021-12-28 09:08:52,975 INFO L793 eck$LassoCheckResult]: Loop: 1375#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1376#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1389#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1375#L598-4 [2021-12-28 09:08:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2021-12-28 09:08:52,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:52,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964144766] [2021-12-28 09:08:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:52,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:52,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:52,999 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2021-12-28 09:08:52,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:52,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212941043] [2021-12-28 09:08:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:53,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:53,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:53,010 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2021-12-28 09:08:53,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:53,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455142266] [2021-12-28 09:08:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:53,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:53,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:53,039 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:57,481 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:08:57,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:08:57,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:08:57,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:08:57,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:08:57,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:57,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:08:57,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:08:57,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration13_Lasso [2021-12-28 09:08:57,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:08:57,481 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:08:57,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:57,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:58,413 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:08:58,413 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:08:58,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,419 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) [2021-12-28 09:08:58,420 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 [2021-12-28 09:08:58,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:58,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,459 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) [2021-12-28 09:08:58,462 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 [2021-12-28 09:08:58,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:58,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,523 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) [2021-12-28 09:08:58,524 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 [2021-12-28 09:08:58,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:58,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,565 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) [2021-12-28 09:08:58,568 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 [2021-12-28 09:08:58,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 [2021-12-28 09:08:58,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,632 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 [2021-12-28 09:08:58,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,648 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) [2021-12-28 09:08:58,648 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 [2021-12-28 09:08:58,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,700 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 [2021-12-28 09:08:58,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,709 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) [2021-12-28 09:08:58,710 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 [2021-12-28 09:08:58,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,749 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 [2021-12-28 09:08:58,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,751 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) [2021-12-28 09:08:58,761 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 [2021-12-28 09:08:58,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:58,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,803 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) [2021-12-28 09:08:58,803 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 [2021-12-28 09:08:58,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:58,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,848 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) [2021-12-28 09:08:58,849 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 [2021-12-28 09:08:58,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:58,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:58,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,890 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) [2021-12-28 09:08:58,892 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 [2021-12-28 09:08:58,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:58,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:58,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:58,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:58,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:58,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:58,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:58,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:08:58,917 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-28 09:08:58,917 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-28 09:08:58,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:58,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:58,918 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) [2021-12-28 09:08:58,920 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 [2021-12-28 09:08:58,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:08:58,930 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-28 09:08:58,930 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:08:58,930 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0#1.base) ULTIMATE.start_main_~z~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0#1.base) ULTIMATE.start_main_~z~0#1.offset)_2 + 100 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 - 2 >= 0] [2021-12-28 09:08:58,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:59,034 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2021-12-28 09:08:59,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:59,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-28 09:08:59,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:59,137 INFO L387 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 14 treesize of output 12 [2021-12-28 09:08:59,142 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 [2021-12-28 09:08:59,166 INFO L387 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 [2021-12-28 09:08:59,227 INFO L387 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 30 treesize of output 18 [2021-12-28 09:08:59,268 INFO L387 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 30 treesize of output 18 [2021-12-28 09:08:59,311 INFO L387 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 30 treesize of output 18 [2021-12-28 09:08:59,356 INFO L387 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 30 treesize of output 18 [2021-12-28 09:08:59,404 INFO L387 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 30 treesize of output 18 [2021-12-28 09:08:59,453 INFO L387 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 30 treesize of output 18 [2021-12-28 09:08:59,499 INFO L387 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 30 treesize of output 18 [2021-12-28 09:08:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:59,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-28 09:08:59,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:59,620 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-28 09:08:59,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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) [2021-12-28 09:08:59,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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 28 states and 33 transitions. Complement of second has 15 states. [2021-12-28 09:08:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-28 09:08:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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) [2021-12-28 09:08:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2021-12-28 09:08:59,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 3 letters. [2021-12-28 09:08:59,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:59,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-28 09:08:59,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:59,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 6 letters. [2021-12-28 09:08:59,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:59,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2021-12-28 09:08:59,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:59,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 23 transitions. [2021-12-28 09:08:59,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-28 09:08:59,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-28 09:08:59,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2021-12-28 09:08:59,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:59,765 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-28 09:08:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2021-12-28 09:08:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-28 09:08:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 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) [2021-12-28 09:08:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-12-28 09:08:59,765 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-28 09:08:59,765 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-28 09:08:59,765 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-28 09:08:59,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2021-12-28 09:08:59,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:59,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:59,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:59,766 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:59,766 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:59,766 INFO L791 eck$LassoCheckResult]: Stem: 1699#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1700#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1713#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1709#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1710#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1711#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1712#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1714#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1715#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1720#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1705#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1706#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1717#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1701#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1702#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1718#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1707#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 1708#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1716#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1703#L598-4 [2021-12-28 09:08:59,766 INFO L793 eck$LassoCheckResult]: Loop: 1703#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1704#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1719#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1703#L598-4 [2021-12-28 09:08:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:59,766 INFO L85 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2021-12-28 09:08:59,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:59,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432199855] [2021-12-28 09:08:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:59,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:59,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:59,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432199855] [2021-12-28 09:08:59,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432199855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:59,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:59,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 09:08:59,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303489085] [2021-12-28 09:08:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:59,879 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2021-12-28 09:08:59,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:59,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785380862] [2021-12-28 09:08:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:59,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:59,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:59,890 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:09:00,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:09:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 09:09:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-28 09:09:00,010 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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) [2021-12-28 09:09:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:09:00,057 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2021-12-28 09:09:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 09:09:00,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2021-12-28 09:09:00,058 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-28 09:09:00,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2021-12-28 09:09:00,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-28 09:09:00,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-28 09:09:00,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-28 09:09:00,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:09:00,058 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 09:09:00,058 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 09:09:00,058 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 09:09:00,058 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-28 09:09:00,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-28 09:09:00,058 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-28 09:09:00,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-28 09:09:00,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.12 09:09:00 BoogieIcfgContainer [2021-12-28 09:09:00,063 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-28 09:09:00,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 09:09:00,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 09:09:00,064 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 09:09:00,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:08:39" (3/4) ... [2021-12-28 09:09:00,066 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-28 09:09:00,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 09:09:00,066 INFO L158 Benchmark]: Toolchain (without parser) took 20910.77ms. Allocated memory was 52.4MB in the beginning and 163.6MB in the end (delta: 111.1MB). Free memory was 28.7MB in the beginning and 84.3MB in the end (delta: -55.6MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2021-12-28 09:09:00,067 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 34.7MB in the beginning and 34.7MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:09:00,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.24ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 28.5MB in the beginning and 53.9MB in the end (delta: -25.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2021-12-28 09:09:00,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.20ms. Allocated memory is still 75.5MB. Free memory was 53.7MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:09:00,067 INFO L158 Benchmark]: Boogie Preprocessor took 15.40ms. Allocated memory is still 75.5MB. Free memory was 51.6MB in the beginning and 50.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:09:00,067 INFO L158 Benchmark]: RCFGBuilder took 285.16ms. Allocated memory is still 75.5MB. Free memory was 50.1MB in the beginning and 53.0MB in the end (delta: -2.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2021-12-28 09:09:00,068 INFO L158 Benchmark]: BuchiAutomizer took 20327.46ms. Allocated memory was 75.5MB in the beginning and 163.6MB in the end (delta: 88.1MB). Free memory was 52.6MB in the beginning and 85.4MB in the end (delta: -32.8MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2021-12-28 09:09:00,068 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 163.6MB. Free memory was 85.4MB in the beginning and 84.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:09:00,069 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 34.7MB in the beginning and 34.7MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.24ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 28.5MB in the beginning and 53.9MB in the end (delta: -25.4MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.20ms. Allocated memory is still 75.5MB. Free memory was 53.7MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.40ms. Allocated memory is still 75.5MB. Free memory was 51.6MB in the beginning and 50.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.16ms. Allocated memory is still 75.5MB. Free memory was 50.1MB in the beginning and 53.0MB in the end (delta: -2.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 20327.46ms. Allocated memory was 75.5MB in the beginning and 163.6MB in the end (delta: 88.1MB). Free memory was 52.6MB in the beginning and 85.4MB in the end (delta: -32.8MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 163.6MB. Free memory was 85.4MB in the beginning and 84.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y][y] + 100 and consists of 14 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z][z] + 100 and consists of 13 locations. 12 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.2s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 17.1s. Construction of modules took 1.0s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 117 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 335 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2202 IncrementalHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 235 mSDtfsCounter, 2202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU12 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital332 mio100 ax105 hnf100 lsp89 ukn60 mio100 lsp35 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-28 09:09:00,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE