./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array14_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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-15/array14_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 a0f9dc1e3a944fe0c87fb9c3f72dec5466e715e61eb5b701f6540feca3c935ad --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:04:41,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:04:41,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:04:41,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:04:41,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:04:41,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:04:41,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:04:41,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:04:41,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:04:41,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:04:41,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:04:41,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:04:41,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:04:41,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:04:41,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:04:41,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:04:41,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:04:41,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:04:41,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:04:41,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:04:41,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:04:41,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:04:41,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:04:41,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:04:41,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:04:41,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:04:41,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:04:41,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:04:41,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:04:41,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:04:41,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:04:41,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:04:41,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:04:41,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:04:41,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:04:41,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:04:41,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:04:41,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:04:41,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:04:41,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:04:41,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:04:41,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:04:41,525 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:04:41,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:04:41,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:04:41,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:04:41,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:04:41,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:04:41,527 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:04:41,527 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:04:41,527 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:04:41,527 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:04:41,528 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:04:41,528 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:04:41,528 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:04:41,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:04:41,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:04:41,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:04:41,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:04:41,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:04:41,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:04:41,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:04:41,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:04:41,530 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:04:41,530 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:04:41,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:04:41,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:04:41,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:04:41,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:04:41,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:04:41,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:04:41,532 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:04:41,532 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 -> a0f9dc1e3a944fe0c87fb9c3f72dec5466e715e61eb5b701f6540feca3c935ad [2021-12-15 17:04:41,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:04:41,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:04:41,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:04:41,778 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:04:41,779 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:04:41,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array14_alloca.i [2021-12-15 17:04:41,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2229576f/cd91b1e418ee42b296d7109bcd2f701c/FLAG290952334 [2021-12-15 17:04:42,218 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:04:42,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array14_alloca.i [2021-12-15 17:04:42,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2229576f/cd91b1e418ee42b296d7109bcd2f701c/FLAG290952334 [2021-12-15 17:04:42,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2229576f/cd91b1e418ee42b296d7109bcd2f701c [2021-12-15 17:04:42,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:04:42,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:04:42,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:04:42,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:04:42,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:04:42,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6161f45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42, skipping insertion in model container [2021-12-15 17:04:42,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:04:42,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:04:42,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:04:42,528 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:04:42,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:04:42,591 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:04:42,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42 WrapperNode [2021-12-15 17:04:42,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:04:42,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:04:42,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:04:42,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:04:42,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,629 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-12-15 17:04:42,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:04:42,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:04:42,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:04:42,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:04:42,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:04:42,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:04:42,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:04:42,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:04:42,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (1/1) ... [2021-12-15 17:04:42,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:42,689 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-15 17:04:42,711 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-15 17:04:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:04:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:04:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:04:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:04:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:04:42,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:04:42,791 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:04:42,792 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:04:42,920 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:04:42,924 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:04:42,924 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 17:04:42,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:04:42 BoogieIcfgContainer [2021-12-15 17:04:42,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:04:42,926 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:04:42,926 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:04:42,928 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:04:42,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:04:42,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:04:42" (1/3) ... [2021-12-15 17:04:42,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76f78c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:04:42, skipping insertion in model container [2021-12-15 17:04:42,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:04:42,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:04:42" (2/3) ... [2021-12-15 17:04:42,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76f78c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:04:42, skipping insertion in model container [2021-12-15 17:04:42,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:04:42,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:04:42" (3/3) ... [2021-12-15 17:04:42,931 INFO L388 chiAutomizerObserver]: Analyzing ICFG array14_alloca.i [2021-12-15 17:04:42,959 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:04:42,959 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:04:42,959 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:04:42,959 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:04:42,959 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:04:42,960 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:04:42,960 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:04:42,960 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:04:42,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-15 17:04:42,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:04:42,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:42,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:42,997 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:04:42,997 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:04:42,997 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:04:42,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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-15 17:04:42,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-12-15 17:04:42,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:43,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:43,000 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:04:43,000 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:04:43,005 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 8#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6#L370-3true [2021-12-15 17:04:43,006 INFO L793 eck$LassoCheckResult]: Loop: 6#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 6#L370-3true [2021-12-15 17:04:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2021-12-15 17:04:43,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:43,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803457445] [2021-12-15 17:04:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:43,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:43,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:43,163 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:43,165 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2021-12-15 17:04:43,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:43,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384694595] [2021-12-15 17:04:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:43,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:43,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:43,207 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2021-12-15 17:04:43,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:43,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779088105] [2021-12-15 17:04:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:43,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:43,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:43,253 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:43,492 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:04:43,492 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:04:43,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:04:43,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:04:43,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:04:43,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:43,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:04:43,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:04:43,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration1_Lasso [2021-12-15 17:04:43,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:04:43,494 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:04:43,509 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-15 17:04:43,514 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-15 17:04:43,518 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-15 17:04:43,520 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-15 17:04:43,522 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-15 17:04:43,611 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-15 17:04:43,613 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-15 17:04:43,615 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-15 17:04:43,617 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-15 17:04:43,618 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-15 17:04:43,620 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-15 17:04:43,622 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-15 17:04:43,766 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:04:43,769 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:04:43,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:43,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:43,771 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-15 17:04:43,784 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-15 17:04:43,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:43,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:43,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:43,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:43,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:43,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:43,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:43,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:43,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:43,830 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-15 17:04:43,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:43,833 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-15 17:04:43,834 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-15 17:04:43,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:43,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:43,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:43,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:43,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:43,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:43,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:43,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:43,877 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-15 17:04:43,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:43,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:43,880 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-15 17:04:43,881 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-15 17:04:43,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:43,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:43,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:43,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:43,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:43,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:43,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:43,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:43,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:43,922 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-15 17:04:43,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:43,939 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-15 17:04:43,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:43,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:43,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:43,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:43,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:43,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:43,962 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-15 17:04:43,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:43,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:43,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:43,982 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-15 17:04:43,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:43,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:43,983 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-15 17:04:43,984 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-15 17:04:43,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:43,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:43,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:43,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:43,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:43,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:43,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:43,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:44,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:44,024 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-15 17:04:44,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:44,025 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-15 17:04:44,026 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-15 17:04:44,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:44,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:44,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:44,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:44,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:44,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:44,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:44,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:44,083 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-15 17:04:44,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:44,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:44,084 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-15 17:04:44,085 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-15 17:04:44,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:44,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:44,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:44,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:44,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:44,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:44,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:44,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:44,132 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-15 17:04:44,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:44,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:44,134 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-15 17:04:44,135 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-15 17:04:44,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:44,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:44,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:44,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:44,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:44,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:44,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:44,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:04:44,202 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2021-12-15 17:04:44,202 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-15 17:04:44,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:44,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:44,216 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-15 17:04:44,234 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:04:44,242 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-15 17:04:44,260 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:04:44,260 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:04:44,261 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2021-12-15 17:04:44,280 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-15 17:04:44,287 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-12-15 17:04:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:44,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:44,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:44,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:44,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:44,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-15 17:04:44,377 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:04:44,378 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:44,405 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 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). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2021-12-15 17:04:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-12-15 17:04:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2021-12-15 17:04:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2021-12-15 17:04:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:44,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2021-12-15 17:04:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:44,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2021-12-15 17:04:44,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:44,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2021-12-15 17:04:44,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-15 17:04:44,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:04:44,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2021-12-15 17:04:44,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:04:44,419 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-12-15 17:04:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2021-12-15 17:04:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-15 17:04:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-15 17:04:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2021-12-15 17:04:44,434 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-12-15 17:04:44,434 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-12-15 17:04:44,434 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:04:44,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2021-12-15 17:04:44,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:44,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:44,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:44,435 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:44,435 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:44,436 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 121#L367 assume !(main_~length~0#1 < 1); 115#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 116#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 117#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 118#L370-4 main_~j~0#1 := 0; 119#L378-2 [2021-12-15 17:04:44,436 INFO L793 eck$LassoCheckResult]: Loop: 119#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 120#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 119#L378-2 [2021-12-15 17:04:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2021-12-15 17:04:44,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:44,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212766946] [2021-12-15 17:04:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:44,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:44,470 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-15 17:04:44,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212766946] [2021-12-15 17:04:44,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212766946] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:04:44,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:04:44,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:04:44,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002633148] [2021-12-15 17:04:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:04:44,474 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:04:44,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2021-12-15 17:04:44,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:44,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162722313] [2021-12-15 17:04:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:44,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:44,479 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:44,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:44,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:04:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:04:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:04:44,519 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:04:44,536 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-12-15 17:04:44,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:04:44,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-12-15 17:04:44,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:44,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-12-15 17:04:44,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 17:04:44,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-15 17:04:44,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-12-15 17:04:44,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:04:44,538 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-15 17:04:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-12-15 17:04:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2021-12-15 17:04:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-12-15 17:04:44,540 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-15 17:04:44,540 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-15 17:04:44,540 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:04:44,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-12-15 17:04:44,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:44,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:44,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:44,541 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:44,541 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:44,541 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 148#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 149#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 150#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 155#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 157#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 156#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 151#L370-4 main_~j~0#1 := 0; 152#L378-2 [2021-12-15 17:04:44,541 INFO L793 eck$LassoCheckResult]: Loop: 152#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 153#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 152#L378-2 [2021-12-15 17:04:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2021-12-15 17:04:44,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:44,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191557061] [2021-12-15 17:04:44,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:44,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:44,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:44,557 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2021-12-15 17:04:44,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:44,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985972656] [2021-12-15 17:04:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:44,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:44,562 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:44,565 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:44,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2021-12-15 17:04:44,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:44,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601171327] [2021-12-15 17:04:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:44,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:44,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:44,583 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:44,797 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:04:44,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:04:44,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:04:44,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:04:44,798 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:04:44,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:44,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:04:44,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:04:44,798 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration3_Lasso [2021-12-15 17:04:44,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:04:44,798 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:04:44,800 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-15 17:04:44,802 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-15 17:04:44,803 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-15 17:04:44,805 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-15 17:04:44,883 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-15 17:04:44,905 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-15 17:04:44,906 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-15 17:04:44,908 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-15 17:04:44,910 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-15 17:04:44,911 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-15 17:04:44,913 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-15 17:04:44,915 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-15 17:04:45,082 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:04:45,082 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:04:45,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:45,100 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-15 17:04:45,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:45,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:45,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:45,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:45,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:45,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:45,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:45,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:45,121 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-15 17:04:45,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:45,147 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-15 17:04:45,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:45,149 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-15 17:04:45,168 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-15 17:04:45,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:45,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:45,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:45,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:45,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:45,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:45,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:45,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:45,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:45,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:45,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:45,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:45,210 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-15 17:04:45,211 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-15 17:04:45,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:45,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:45,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:45,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:45,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:45,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:45,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:45,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:45,253 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-15 17:04:45,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:45,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:45,255 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-15 17:04:45,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:45,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:45,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:45,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:45,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:45,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:45,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:45,290 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-15 17:04:45,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:04:45,307 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-12-15 17:04:45,307 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2021-12-15 17:04:45,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:45,308 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-15 17:04:45,336 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-15 17:04:45,336 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:04:45,350 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:04:45,350 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:04:45,350 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 2*ULTIMATE.start_main_~j~0#1 + 1 Supporting invariants [] [2021-12-15 17:04:45,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:45,375 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-12-15 17:04:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:45,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:45,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:45,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:45,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:45,425 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-15 17:04:45,426 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:04:45,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:45,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 5 states. [2021-12-15 17:04:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2021-12-15 17:04:45,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-15 17:04:45,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:45,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2021-12-15 17:04:45,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:45,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2021-12-15 17:04:45,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:45,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2021-12-15 17:04:45,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:45,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2021-12-15 17:04:45,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:04:45,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:04:45,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2021-12-15 17:04:45,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:45,437 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-12-15 17:04:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2021-12-15 17:04:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-15 17:04:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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-15 17:04:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2021-12-15 17:04:45,438 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-12-15 17:04:45,438 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2021-12-15 17:04:45,439 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:04:45,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2021-12-15 17:04:45,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:45,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:45,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:45,439 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:45,440 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:45,440 INFO L791 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 254#L367 assume !(main_~length~0#1 < 1); 245#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 246#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 247#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 255#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 257#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 256#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 248#L370-4 main_~j~0#1 := 0; 249#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 250#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 251#L378-2 [2021-12-15 17:04:45,440 INFO L793 eck$LassoCheckResult]: Loop: 251#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 258#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 251#L378-2 [2021-12-15 17:04:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2021-12-15 17:04:45,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:45,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479020067] [2021-12-15 17:04:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:45,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,457 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2021-12-15 17:04:45,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:45,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899344520] [2021-12-15 17:04:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:45,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,463 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2021-12-15 17:04:45,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:45,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639050337] [2021-12-15 17:04:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:45,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:45,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:45,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639050337] [2021-12-15 17:04:45,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639050337] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:04:45,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751112261] [2021-12-15 17:04:45,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:45,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:04:45,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:45,503 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:04:45,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-15 17:04:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:45,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:04:45,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:45,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:04:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:45,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751112261] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:04:45,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:04:45,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 17:04:45,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936467083] [2021-12-15 17:04:45,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:04:45,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:04:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 17:04:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-15 17:04:45,692 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:45,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:04:45,766 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2021-12-15 17:04:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:04:45,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2021-12-15 17:04:45,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:45,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2021-12-15 17:04:45,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-15 17:04:45,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:04:45,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2021-12-15 17:04:45,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:45,768 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2021-12-15 17:04:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2021-12-15 17:04:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2021-12-15 17:04:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-12-15 17:04:45,770 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-12-15 17:04:45,770 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-12-15 17:04:45,770 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:04:45,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2021-12-15 17:04:45,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:45,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:45,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:45,771 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:45,771 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:45,771 INFO L791 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 409#L367 assume !(main_~length~0#1 < 1); 400#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 401#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 402#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 410#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 415#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 411#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 412#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 413#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 416#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 403#L370-4 main_~j~0#1 := 0; 404#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 405#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 406#L378-2 [2021-12-15 17:04:45,771 INFO L793 eck$LassoCheckResult]: Loop: 406#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 414#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 406#L378-2 [2021-12-15 17:04:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2021-12-15 17:04:45,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:45,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485375317] [2021-12-15 17:04:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:45,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,783 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,791 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2021-12-15 17:04:45,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:45,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054247253] [2021-12-15 17:04:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:45,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,797 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2021-12-15 17:04:45,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:45,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132182713] [2021-12-15 17:04:45,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:45,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:45,816 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:46,082 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:04:46,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:04:46,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:04:46,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:04:46,082 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:04:46,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:04:46,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:04:46,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration5_Lasso [2021-12-15 17:04:46,082 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:04:46,082 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:04:46,084 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-15 17:04:46,086 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-15 17:04:46,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-15 17:04:46,089 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-15 17:04:46,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-15 17:04:46,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-15 17:04:46,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-15 17:04:46,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-15 17:04:46,096 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-15 17:04:46,191 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-15 17:04:46,193 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-15 17:04:46,195 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-15 17:04:46,356 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:04:46,356 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:04:46,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,372 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-15 17:04:46,373 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-15 17:04:46,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:46,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:46,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:46,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:46,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-15 17:04:46,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,411 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-15 17:04:46,412 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-15 17:04:46,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:46,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:46,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:46,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:46,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,438 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-15 17:04:46,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,440 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-15 17:04:46,440 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-15 17:04:46,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:46,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:46,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:46,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:46,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:46,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,467 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-15 17:04:46,475 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-15 17:04:46,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:46,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:46,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:46,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:46,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,520 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-15 17:04:46,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,521 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-15 17:04:46,522 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-15 17:04:46,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:46,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:46,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:46,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,557 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-15 17:04:46,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,558 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-15 17:04:46,559 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-15 17:04:46,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:46,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:46,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:46,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:46,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,596 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-15 17:04:46,598 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-15 17:04:46,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-15 17:04:46,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:46,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:46,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:46,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-15 17:04:46,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,626 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-15 17:04:46,626 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-15 17:04:46,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:46,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:04:46,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:04:46,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:04:46,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,661 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-15 17:04:46,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,662 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-15 17:04:46,663 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-15 17:04:46,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-15 17:04:46,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:46,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:46,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:04:46,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-15 17:04:46,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,705 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-15 17:04:46,705 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-15 17:04:46,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:04:46,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:04:46,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:04:46,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:04:46,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:04:46,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:04:46,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:04:46,733 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:04:46,764 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 17:04:46,764 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-15 17:04:46,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:04:46,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,766 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-15 17:04:46,767 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-15 17:04:46,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:04:46,774 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:04:46,774 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:04:46,774 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 2*ULTIMATE.start_main_~j~0#1 + 1 Supporting invariants [] [2021-12-15 17:04:46,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-15 17:04:46,796 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-12-15 17:04:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:46,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:04:46,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:46,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:04:46,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:46,859 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-15 17:04:46,860 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:04:46,860 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:46,867 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 31 transitions. Complement of second has 5 states. [2021-12-15 17:04:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:04:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:04:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2021-12-15 17:04:46,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-15 17:04:46,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:46,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2021-12-15 17:04:46,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:46,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2021-12-15 17:04:46,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:04:46,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2021-12-15 17:04:46,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:46,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2021-12-15 17:04:46,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:04:46,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-15 17:04:46,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2021-12-15 17:04:46,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:46,869 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-12-15 17:04:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2021-12-15 17:04:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-15 17:04:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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-15 17:04:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2021-12-15 17:04:46,870 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-12-15 17:04:46,870 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-12-15 17:04:46,871 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:04:46,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2021-12-15 17:04:46,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-15 17:04:46,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:46,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:46,871 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:46,871 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:04:46,872 INFO L791 eck$LassoCheckResult]: Stem: 528#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 529#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 539#L367 assume !(main_~length~0#1 < 1); 530#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 531#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 532#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 540#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 545#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 541#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 542#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 544#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 546#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 537#L370-4 main_~j~0#1 := 0; 538#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 548#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 547#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 533#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 534#L378-2 [2021-12-15 17:04:46,872 INFO L793 eck$LassoCheckResult]: Loop: 534#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 543#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 534#L378-2 [2021-12-15 17:04:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2021-12-15 17:04:46,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:46,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559430709] [2021-12-15 17:04:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:46,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:46,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:46,890 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2021-12-15 17:04:46,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:46,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653902767] [2021-12-15 17:04:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:46,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:46,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:46,895 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2021-12-15 17:04:46,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:46,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491416959] [2021-12-15 17:04:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:46,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:04:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:46,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:04:46,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491416959] [2021-12-15 17:04:46,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491416959] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:04:46,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734294345] [2021-12-15 17:04:46,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:04:46,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:04:46,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:04:46,956 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:04:46,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-15 17:04:47,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 17:04:47,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:04:47,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:04:47,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:04:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:47,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:04:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:04:47,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734294345] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:04:47,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:04:47,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 17:04:47,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691594056] [2021-12-15 17:04:47,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:04:47,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:04:47,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 17:04:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-12-15 17:04:47,154 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-15 17:04:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:04:47,235 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2021-12-15 17:04:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:04:47,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2021-12-15 17:04:47,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-15 17:04:47,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 62 transitions. [2021-12-15 17:04:47,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-15 17:04:47,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-15 17:04:47,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2021-12-15 17:04:47,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:04:47,237 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-12-15 17:04:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2021-12-15 17:04:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2021-12-15 17:04:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 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-15 17:04:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2021-12-15 17:04:47,241 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2021-12-15 17:04:47,241 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2021-12-15 17:04:47,241 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:04:47,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2021-12-15 17:04:47,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:04:47,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:04:47,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:04:47,242 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:04:47,242 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-15 17:04:47,242 INFO L791 eck$LassoCheckResult]: Stem: 736#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 737#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 747#L367 assume !(main_~length~0#1 < 1); 738#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 739#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 740#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 748#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 758#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 749#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 750#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 756#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 757#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 741#L370-4 main_~j~0#1 := 0; 742#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 760#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 759#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 745#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 746#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 753#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 769#L378-2 [2021-12-15 17:04:47,242 INFO L793 eck$LassoCheckResult]: Loop: 769#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 765#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 751#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 752#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 769#L378-2 [2021-12-15 17:04:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2021-12-15 17:04:47,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:47,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976432654] [2021-12-15 17:04:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:47,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:47,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:47,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-15 17:04:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:47,308 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2021-12-15 17:04:47,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:47,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025800123] [2021-12-15 17:04:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:47,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:47,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:47,315 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:04:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2021-12-15 17:04:47,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:04:47,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921991120] [2021-12-15 17:04:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:04:47,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:04:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:47,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:04:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:04:47,373 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:04:47,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:04:47 BoogieIcfgContainer [2021-12-15 17:04:47,789 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:04:47,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:04:47,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:04:47,790 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:04:47,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:04:42" (3/4) ... [2021-12-15 17:04:47,791 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-15 17:04:47,815 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 17:04:47,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:04:47,815 INFO L158 Benchmark]: Toolchain (without parser) took 5574.46ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 68.0MB in the beginning and 85.4MB in the end (delta: -17.4MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2021-12-15 17:04:47,815 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:04:47,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.03ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 66.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:04:47,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.90ms. Allocated memory is still 98.6MB. Free memory was 66.8MB in the beginning and 64.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:04:47,816 INFO L158 Benchmark]: Boogie Preprocessor took 30.92ms. Allocated memory is still 98.6MB. Free memory was 64.8MB in the beginning and 63.8MB in the end (delta: 990.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:04:47,816 INFO L158 Benchmark]: RCFGBuilder took 263.75ms. Allocated memory is still 98.6MB. Free memory was 63.8MB in the beginning and 53.9MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:04:47,817 INFO L158 Benchmark]: BuchiAutomizer took 4863.73ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 53.9MB in the beginning and 87.5MB in the end (delta: -33.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2021-12-15 17:04:47,817 INFO L158 Benchmark]: Witness Printer took 25.00ms. Allocated memory is still 163.6MB. Free memory was 87.5MB in the beginning and 85.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:04:47,819 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.17ms. Allocated memory is still 98.6MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.03ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 66.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.90ms. Allocated memory is still 98.6MB. Free memory was 66.8MB in the beginning and 64.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.92ms. Allocated memory is still 98.6MB. Free memory was 64.8MB in the beginning and 63.8MB in the end (delta: 990.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 263.75ms. Allocated memory is still 98.6MB. Free memory was 63.8MB in the beginning and 53.9MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 4863.73ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 53.9MB in the beginning and 87.5MB in the end (delta: -33.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Witness Printer took 25.00ms. Allocated memory is still 163.6MB. Free memory was 87.5MB in the beginning and 85.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[arr] + -4 * i + -1 * arr and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 66 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital126 mio100 ax100 hnf99 lsp93 ukn84 mio100 lsp59 div100 bol100 ite100 ukn100 eq158 hnf92 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {j=1, arr=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29068ece=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e8d7ab6=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e8d7ab6=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@578d9957=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@17892c55=0, length=2, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6eb9d9ef=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@42173ac9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@2357ac25=0, arr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79e5b52c=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i