./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/Piecewise.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-crafted/Piecewise.c -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 36155f521cfe170e9c03fd915618e68821fe0430 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:29:20,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:29:20,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:29:20,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:29:20,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:29:20,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:29:20,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:29:20,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:29:20,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:29:20,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:29:20,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:29:20,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:29:20,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:29:20,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:29:20,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:29:20,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:29:20,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:29:20,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:29:20,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:29:20,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:29:20,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:29:20,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:29:20,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:29:20,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:29:20,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:29:20,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:29:20,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:29:20,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:29:20,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:29:20,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:29:20,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:29:20,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:29:20,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:29:20,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:29:20,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:29:20,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:29:20,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:29:20,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:29:20,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:29:20,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:29:20,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:29:20,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:29:20,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:29:20,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:29:20,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:29:20,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:29:20,335 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:29:20,336 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:29:20,336 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:29:20,336 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:29:20,337 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:29:20,337 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:29:20,337 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:29:20,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:29:20,338 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:29:20,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:29:20,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:29:20,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:29:20,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:29:20,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:29:20,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:29:20,340 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:29:20,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:29:20,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:29:20,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:29:20,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:29:20,341 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:29:20,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:29:20,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:29:20,342 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:29:20,342 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:29:20,343 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:29:20,344 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 36155f521cfe170e9c03fd915618e68821fe0430 [2019-11-28 20:29:20,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:29:20,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:29:20,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:29:20,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:29:20,689 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:29:20,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Piecewise.c [2019-11-28 20:29:20,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d8bf03f/15e0493062c84f9baf01b5affc49bc53/FLAGb33c7bd93 [2019-11-28 20:29:21,217 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:29:21,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Piecewise.c [2019-11-28 20:29:21,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d8bf03f/15e0493062c84f9baf01b5affc49bc53/FLAGb33c7bd93 [2019-11-28 20:29:21,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d8bf03f/15e0493062c84f9baf01b5affc49bc53 [2019-11-28 20:29:21,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:29:21,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:29:21,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:29:21,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:29:21,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:29:21,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2135f404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21, skipping insertion in model container [2019-11-28 20:29:21,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:29:21,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:29:21,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:29:21,815 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:29:21,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:29:21,850 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:29:21,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21 WrapperNode [2019-11-28 20:29:21,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:29:21,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:29:21,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:29:21,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:29:21,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:29:21,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:29:21,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:29:21,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:29:21,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... [2019-11-28 20:29:21,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:29:21,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:29:21,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:29:21,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:29:21,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:22,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:29:22,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:29:22,196 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:29:22,196 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:29:22,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:29:22 BoogieIcfgContainer [2019-11-28 20:29:22,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:29:22,198 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:29:22,198 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:29:22,202 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:29:22,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:29:22,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:29:21" (1/3) ... [2019-11-28 20:29:22,205 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a31620d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:29:22, skipping insertion in model container [2019-11-28 20:29:22,206 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:29:22,206 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:21" (2/3) ... [2019-11-28 20:29:22,207 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a31620d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:29:22, skipping insertion in model container [2019-11-28 20:29:22,207 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:29:22,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:29:22" (3/3) ... [2019-11-28 20:29:22,209 INFO L371 chiAutomizerObserver]: Analyzing ICFG Piecewise.c [2019-11-28 20:29:22,266 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:29:22,266 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:29:22,266 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:29:22,266 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:29:22,267 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:29:22,267 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:29:22,267 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:29:22,267 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:29:22,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 20:29:22,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:22,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:22,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:22,325 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:29:22,326 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:29:22,326 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:29:22,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 20:29:22,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:22,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:22,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:22,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:29:22,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:29:22,342 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L26-2true [2019-11-28 20:29:22,342 INFO L796 eck$LassoCheckResult]: Loop: 8#L26-2true assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 6#L23true assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 8#L26-2true [2019-11-28 20:29:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:29:22,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756085506] [2019-11-28 20:29:22,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:22,471 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-28 20:29:22,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:22,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452002015] [2019-11-28 20:29:22,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:22,492 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:22,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:22,495 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-28 20:29:22,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:22,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877371931] [2019-11-28 20:29:22,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:22,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:22,620 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:22,621 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:22,621 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:22,621 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:22,622 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:29:22,622 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:22,622 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:22,622 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:22,623 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration1_Loop [2019-11-28 20:29:22,623 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:22,623 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:22,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:22,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:22,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:22,791 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:22,792 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:22,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:22,801 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:22,815 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:29:22,815 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:22,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:22,829 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:22,834 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:29:22,834 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:22,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:22,842 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:22,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:29:22,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:29:22,893 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:29:22,899 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:22,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:22,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:22,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:22,900 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:29:22,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:22,900 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:22,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:22,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration1_Loop [2019-11-28 20:29:22,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:22,901 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:22,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:22,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:22,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:23,020 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:23,027 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:23,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:23,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:23,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:23,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:23,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:23,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:29:23,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:23,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:23,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:23,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:23,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:23,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:23,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:23,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:29:23,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:23,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:23,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:23,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:23,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:29:23,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:23,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:23,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:23,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:29:23,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:29:23,144 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:29:23,152 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:29:23,152 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:23,169 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:29:23,170 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:29:23,170 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:29:23,171 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2019-11-28 20:29:23,177 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:23,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:23,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:23,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:23,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:23,279 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 [2019-11-28 20:29:23,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-11-28 20:29:23,373 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 37 states and 48 transitions. Complement of second has 8 states. [2019-11-28 20:29:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:29:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-28 20:29:23,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-28 20:29:23,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:23,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 20:29:23,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:23,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 20:29:23,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:23,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2019-11-28 20:29:23,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:29:23,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 13 states and 19 transitions. [2019-11-28 20:29:23,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:29:23,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:29:23,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-28 20:29:23,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:29:23,414 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 20:29:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-28 20:29:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-28 20:29:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:29:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2019-11-28 20:29:23,454 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-11-28 20:29:23,454 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-11-28 20:29:23,454 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:29:23,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2019-11-28 20:29:23,455 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:29:23,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:23,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:23,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:29:23,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:29:23,457 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 87#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 88#L23 [2019-11-28 20:29:23,458 INFO L796 eck$LassoCheckResult]: Loop: 88#L23 assume !(main_~q~0 < main_~p~0); 89#L26 assume !(main_~p~0 < main_~q~0); 92#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 88#L23 [2019-11-28 20:29:23,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:23,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-11-28 20:29:23,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:23,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566459582] [2019-11-28 20:29:23,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:23,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:23,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash 44836, now seen corresponding path program 1 times [2019-11-28 20:29:23,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:23,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447858044] [2019-11-28 20:29:23,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:23,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447858044] [2019-11-28 20:29:23,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:29:23,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:29:23,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580250804] [2019-11-28 20:29:23,580 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:29:23,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:29:23,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:29:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:29:23,587 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:29:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:29:23,612 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-28 20:29:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:29:23,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-28 20:29:23,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:23,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-11-28 20:29:23,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:29:23,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:29:23,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-28 20:29:23,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:29:23,621 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-28 20:29:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-28 20:29:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-28 20:29:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:29:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-11-28 20:29:23,625 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-28 20:29:23,625 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-11-28 20:29:23,626 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:29:23,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-11-28 20:29:23,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:23,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:23,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:23,635 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:29:23,635 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:29:23,637 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 117#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 118#L23 assume !(main_~q~0 < main_~p~0); 114#L26 [2019-11-28 20:29:23,637 INFO L796 eck$LassoCheckResult]: Loop: 114#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 115#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 121#L23 assume !(main_~q~0 < main_~p~0); 114#L26 [2019-11-28 20:29:23,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-28 20:29:23,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:23,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022161581] [2019-11-28 20:29:23,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:23,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash 47414, now seen corresponding path program 1 times [2019-11-28 20:29:23,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:23,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833625301] [2019-11-28 20:29:23,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:23,672 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash 925832530, now seen corresponding path program 1 times [2019-11-28 20:29:23,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:23,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257579972] [2019-11-28 20:29:23,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:23,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:23,772 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:23,772 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:23,772 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:23,772 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:23,773 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:29:23,773 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:23,773 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:23,773 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:23,773 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration3_Loop [2019-11-28 20:29:23,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:23,774 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:23,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:23,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:23,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:23,909 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:23,910 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:23,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:23,916 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:23,922 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:29:23,922 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:23,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:23,940 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:23,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:29:23,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:29:24,095 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:29:24,098 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:24,098 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:24,099 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:24,099 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:24,099 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:29:24,099 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,099 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:24,099 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:24,099 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration3_Loop [2019-11-28 20:29:24,100 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:24,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:24,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,260 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:24,260 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:24,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:24,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:24,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:24,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:24,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:29:24,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:29:24,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:24,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:24,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:24,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:29:24,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:24,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:24,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:24,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:29:24,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,316 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:29:24,342 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 20:29:24,342 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:24,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:29:24,358 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:29:24,359 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:29:24,359 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = 1*ULTIMATE.start_main_~p~0 Supporting invariants [] [2019-11-28 20:29:24,363 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:24,395 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:24,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:24,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:24,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:24,453 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:29:24,453 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 20:29:24,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 16 states and 20 transitions. Complement of second has 7 states. [2019-11-28 20:29:24,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:29:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-11-28 20:29:24,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-28 20:29:24,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:24,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 20:29:24,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:24,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-28 20:29:24,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:24,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-28 20:29:24,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:24,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 17 transitions. [2019-11-28 20:29:24,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:29:24,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:29:24,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-28 20:29:24,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:29:24,493 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 20:29:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-28 20:29:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-28 20:29:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:29:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 20:29:24,497 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:29:24,497 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:29:24,497 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:29:24,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 20:29:24,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:24,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:24,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:24,500 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-11-28 20:29:24,500 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:29:24,500 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 186#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 190#L23 assume !(main_~q~0 < main_~p~0); 192#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 184#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 191#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 182#L26-2 [2019-11-28 20:29:24,501 INFO L796 eck$LassoCheckResult]: Loop: 182#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 187#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 182#L26-2 [2019-11-28 20:29:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:24,501 INFO L82 PathProgramCache]: Analyzing trace with hash 925832528, now seen corresponding path program 1 times [2019-11-28 20:29:24,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:24,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129978801] [2019-11-28 20:29:24,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:24,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-28 20:29:24,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:24,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886179752] [2019-11-28 20:29:24,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:24,574 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:24,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:24,576 INFO L82 PathProgramCache]: Analyzing trace with hash 666829459, now seen corresponding path program 2 times [2019-11-28 20:29:24,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:24,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80887465] [2019-11-28 20:29:24,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:24,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:24,657 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:24,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:24,660 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:24,660 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:24,660 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:29:24,660 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,660 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:24,661 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:24,662 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration4_Loop [2019-11-28 20:29:24,662 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:24,663 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:24,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,748 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:24,748 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:24,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:24,772 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:24,795 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:29:24,796 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,811 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:29:24,814 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:24,814 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:24,815 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:24,815 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:24,815 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:29:24,815 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,815 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:24,815 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:24,815 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration4_Loop [2019-11-28 20:29:24,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:24,816 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:24,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:24,898 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:24,898 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:24,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:24,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:24,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:29:24,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:24,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:24,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:24,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:29:24,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,919 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:29:24,924 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 20:29:24,925 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:24,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:29:24,932 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:29:24,932 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:29:24,932 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2019-11-28 20:29:24,935 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:24,969 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:24,970 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:24,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:24,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:24,991 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 [2019-11-28 20:29:24,991 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 20:29:25,013 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 27 states and 34 transitions. Complement of second has 5 states. [2019-11-28 20:29:25,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:29:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 20:29:25,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 20:29:25,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:25,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 20:29:25,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:25,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:29:25,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:25,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-11-28 20:29:25,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:25,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 30 transitions. [2019-11-28 20:29:25,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:29:25,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 20:29:25,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-28 20:29:25,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:29:25,025 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 20:29:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-28 20:29:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-28 20:29:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:29:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-28 20:29:25,031 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 20:29:25,032 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 20:29:25,032 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:29:25,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-28 20:29:25,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:25,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:25,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:25,035 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2019-11-28 20:29:25,035 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:29:25,036 INFO L794 eck$LassoCheckResult]: Stem: 268#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 269#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 272#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 273#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 276#L23 assume !(main_~q~0 < main_~p~0); 265#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 266#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 279#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 280#L26-2 [2019-11-28 20:29:25,036 INFO L796 eck$LassoCheckResult]: Loop: 280#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 281#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 280#L26-2 [2019-11-28 20:29:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash 602336749, now seen corresponding path program 3 times [2019-11-28 20:29:25,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:25,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323649202] [2019-11-28 20:29:25,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-28 20:29:25,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:25,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94904709] [2019-11-28 20:29:25,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,092 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,093 INFO L82 PathProgramCache]: Analyzing trace with hash -974968848, now seen corresponding path program 4 times [2019-11-28 20:29:25,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:25,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092835298] [2019-11-28 20:29:25,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,137 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:25,176 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:25,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:25,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:25,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:25,176 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:29:25,177 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,177 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:25,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:25,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration5_Loop [2019-11-28 20:29:25,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:25,178 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:25,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,248 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:25,248 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:25,260 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:29:25,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:29:25,286 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:29:25,288 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:25,289 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:25,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:25,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:25,289 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:29:25,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:25,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:25,290 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration5_Loop [2019-11-28 20:29:25,290 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:25,290 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:25,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,368 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:25,369 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:25,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:25,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:29:25,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:25,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:25,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:25,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:29:25,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:29:25,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:29:25,432 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:29:25,432 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,447 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:29:25,449 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:29:25,449 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:29:25,449 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2019-11-28 20:29:25,452 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:29:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:25,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:25,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:25,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:25,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:25,520 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 [2019-11-28 20:29:25,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-28 20:29:25,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 29 states and 38 transitions. Complement of second has 5 states. [2019-11-28 20:29:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:29:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 20:29:25,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 20:29:25,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:25,542 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:29:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:25,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:25,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:25,576 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:25,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:25,587 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:29:25,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-28 20:29:25,607 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 29 states and 38 transitions. Complement of second has 5 states. [2019-11-28 20:29:25,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:29:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 20:29:25,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 20:29:25,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:25,612 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:29:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:25,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:25,649 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:25,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:25,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:25,671 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:29:25,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-28 20:29:25,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 33 states and 45 transitions. Complement of second has 4 states. [2019-11-28 20:29:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:29:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:29:25,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 20:29:25,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:25,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 20:29:25,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:25,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-28 20:29:25,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:25,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-11-28 20:29:25,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:29:25,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 36 transitions. [2019-11-28 20:29:25,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 20:29:25,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:29:25,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-28 20:29:25,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:29:25,708 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-28 20:29:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-28 20:29:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2019-11-28 20:29:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:29:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 20:29:25,714 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:29:25,714 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:29:25,714 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:29:25,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-28 20:29:25,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:29:25,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:25,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:25,718 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-11-28 20:29:25,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2019-11-28 20:29:25,718 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 504#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 512#L23 assume !(main_~q~0 < main_~p~0); 511#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 502#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 509#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 510#L26-2 [2019-11-28 20:29:25,718 INFO L796 eck$LassoCheckResult]: Loop: 510#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 505#L23 assume !(main_~q~0 < main_~p~0); 499#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 500#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 508#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 510#L26-2 [2019-11-28 20:29:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash 925832528, now seen corresponding path program 5 times [2019-11-28 20:29:25,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:25,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778342144] [2019-11-28 20:29:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 38328847, now seen corresponding path program 1 times [2019-11-28 20:29:25,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:25,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824109416] [2019-11-28 20:29:25,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,764 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1292746272, now seen corresponding path program 6 times [2019-11-28 20:29:25,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:25,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458301430] [2019-11-28 20:29:25,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:25,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:25,865 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:25,865 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:25,865 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:25,865 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:25,865 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:29:25,865 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,866 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:25,866 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:25,866 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration6_Loop [2019-11-28 20:29:25,866 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:25,866 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:25,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:25,951 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:25,951 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:25,961 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:25,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:29:25,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:29:26,126 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:29:26,127 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:26,128 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:26,128 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:26,128 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:26,128 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:29:26,128 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:26,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:26,129 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration6_Loop [2019-11-28 20:29:26,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:26,130 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:26,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:26,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:26,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:26,232 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:26,232 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:26,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:26,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:26,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:29:26,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:26,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:26,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:29:26,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:29:26,245 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:29:26,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:29:26,249 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:29:26,253 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:29:26,253 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:29:26,253 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2019-11-28 20:29:26,259 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:29:26,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:26,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:26,292 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:26,299 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:29:26,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:26,330 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 20:29:26,330 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-28 20:29:26,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 41 states and 58 transitions. Complement of second has 10 states. [2019-11-28 20:29:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:29:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-11-28 20:29:26,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-28 20:29:26,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:26,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-28 20:29:26,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:26,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 10 letters. [2019-11-28 20:29:26,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:26,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-11-28 20:29:26,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:26,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 34 states and 48 transitions. [2019-11-28 20:29:26,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:29:26,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 20:29:26,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2019-11-28 20:29:26,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:29:26,420 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-28 20:29:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2019-11-28 20:29:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2019-11-28 20:29:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 20:29:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2019-11-28 20:29:26,425 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-28 20:29:26,425 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-28 20:29:26,425 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:29:26,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2019-11-28 20:29:26,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:29:26,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:29:26,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:29:26,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2019-11-28 20:29:26,434 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:29:26,434 INFO L794 eck$LassoCheckResult]: Stem: 625#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~p~0, main_~q~0;havoc main_~p~0;havoc main_~q~0;main_~q~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~p~0 := main_#t~nondet1;havoc main_#t~nondet1; 626#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 637#L23 assume !(main_~q~0 < main_~p~0); 621#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 622#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 634#L23 assume main_~q~0 < main_~p~0;main_~q~0 := main_~q~0 - 1;main_~p~0 := main_#t~nondet2;havoc main_#t~nondet2; 635#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 631#L23 [2019-11-28 20:29:26,434 INFO L796 eck$LassoCheckResult]: Loop: 631#L23 assume !(main_~q~0 < main_~p~0); 633#L26 assume main_~p~0 < main_~q~0;main_~p~0 := main_~p~0 - 1;main_~q~0 := main_#t~nondet3;havoc main_#t~nondet3; 630#L26-2 assume !!((main_~q~0 > 0 && main_~p~0 > 0) && main_~p~0 != main_~q~0); 631#L23 [2019-11-28 20:29:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1363962694, now seen corresponding path program 7 times [2019-11-28 20:29:26,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:26,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34998886] [2019-11-28 20:29:26,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:26,455 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash 44774, now seen corresponding path program 2 times [2019-11-28 20:29:26,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:26,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531429931] [2019-11-28 20:29:26,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:26,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:26,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash 872985485, now seen corresponding path program 8 times [2019-11-28 20:29:26,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:29:26,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212816843] [2019-11-28 20:29:26,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:29:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:29:26,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:29:26,509 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:26,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:26,510 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:26,510 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:26,510 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:29:26,510 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,510 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:26,510 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:26,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration7_Loop [2019-11-28 20:29:26,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:26,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:26,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:26,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:26,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:26,655 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:26,655 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:26,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:29:26,664 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:29:26,664 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:26,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:29:26,684 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:29:26,684 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:29:26,689 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:26,718 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:29:26,718 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,927 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:29:26,929 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:29:26,929 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:29:26,929 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:29:26,929 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:29:26,929 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:29:26,930 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:26,930 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:29:26,930 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:29:26,930 INFO L133 ssoRankerPreferences]: Filename of dumped script: Piecewise.c_Iteration7_Loop [2019-11-28 20:29:26,930 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:29:26,930 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:29:26,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:26,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:26,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:29:27,095 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:29:27,096 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:27,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:27,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:27,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:27,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:27,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:27,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:29:27,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:29:27,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:29:27,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:27,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:27,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:27,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:29:27,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:27,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:29:27,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:27,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:27,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:29:27,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:29:27,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:29:27,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:29:27,133 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:29:27,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:29:27,135 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:29:27,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:29:27,143 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:29:27,145 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 20:29:27,146 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:29:27,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:29:27,149 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:29:27,149 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:29:27,149 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = 1*ULTIMATE.start_main_~p~0 Supporting invariants [] [2019-11-28 20:29:27,151 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:29:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:27,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:27,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:27,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:27,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:27,204 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 [2019-11-28 20:29:27,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-28 20:29:27,230 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 27 states and 40 transitions. Complement of second has 7 states. [2019-11-28 20:29:27,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:29:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-11-28 20:29:27,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:29:27,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:27,231 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:29:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:27,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:27,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:27,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:27,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:27,261 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:29:27,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-28 20:29:27,278 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 27 states and 40 transitions. Complement of second has 7 states. [2019-11-28 20:29:27,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:29:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-11-28 20:29:27,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:29:27,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:27,280 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:29:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:29:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:27,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:29:27,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:29:27,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:29:27,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:29:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:29:27,322 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:29:27,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-28 20:29:27,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 36 states and 57 transitions. Complement of second has 6 states. [2019-11-28 20:29:27,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:29:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:29:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-28 20:29:27,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:29:27,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:27,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 20:29:27,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:27,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-28 20:29:27,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:29:27,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 57 transitions. [2019-11-28 20:29:27,347 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:29:27,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2019-11-28 20:29:27,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:29:27,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:29:27,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:29:27,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:29:27,348 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:29:27,348 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:29:27,348 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:29:27,348 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:29:27,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:29:27,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:29:27,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:29:27,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:29:27 BoogieIcfgContainer [2019-11-28 20:29:27,355 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:29:27,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:29:27,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:29:27,356 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:29:27,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:29:22" (3/4) ... [2019-11-28 20:29:27,360 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:29:27,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:29:27,363 INFO L168 Benchmark]: Toolchain (without parser) took 5759.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 956.3 MB in the beginning and 953.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 205.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:27,363 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:29:27,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.83 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:27,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.02 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:29:27,366 INFO L168 Benchmark]: Boogie Preprocessor took 83.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:27,366 INFO L168 Benchmark]: RCFGBuilder took 223.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:27,367 INFO L168 Benchmark]: BuchiAutomizer took 5157.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 953.2 MB in the end (delta: 147.4 MB). Peak memory consumption was 227.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:29:27,368 INFO L168 Benchmark]: Witness Printer took 4.76 ms. Allocated memory is still 1.2 GB. Free memory is still 953.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:29:27,371 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.83 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.02 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 223.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5157.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.7 MB). Free memory was 1.1 GB in the beginning and 953.2 MB in the end (delta: 147.4 MB). Peak memory consumption was 227.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.76 ms. Allocated memory is still 1.2 GB. Free memory is still 953.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function q and consists of 5 locations. One deterministic module has affine ranking function p and consists of 4 locations. One deterministic module has affine ranking function q and consists of 3 locations. One deterministic module has affine ranking function q and consists of 6 locations. One nondeterministic module has affine ranking function q and consists of 3 locations. One nondeterministic module has affine ranking function p and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 49 SDtfs, 56 SDslu, 9 SDs, 0 SdLazy, 120 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax161 hnf99 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp93 dnf112 smp98 tf106 neg98 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...