./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 91fda61e05234dbe68b069d372f5d4b0bb73b229 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:10:44,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:10:44,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:10:44,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:10:44,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:10:44,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:10:44,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:10:44,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:10:44,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:10:44,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:10:44,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:10:44,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:10:44,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:10:44,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:10:44,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:10:44,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:10:44,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:10:44,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:10:44,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:10:44,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:10:44,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:10:44,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:10:44,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:10:44,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:10:44,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:10:44,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:10:44,712 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:10:44,713 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:10:44,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:10:44,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:10:44,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:10:44,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:10:44,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:10:44,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:10:44,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:10:44,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:10:44,721 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:10:44,754 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:10:44,754 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:10:44,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:10:44,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:10:44,756 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:10:44,756 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:10:44,756 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:10:44,756 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:10:44,757 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:10:44,757 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:10:44,757 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:10:44,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:10:44,757 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:10:44,757 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:10:44,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:10:44,759 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:10:44,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:10:44,759 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:10:44,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:10:44,760 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:10:44,760 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:10:44,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:10:44,760 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:10:44,760 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:10:44,760 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:10:44,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:10:44,762 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:10:44,762 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:10:44,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:10:44,762 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:10:44,763 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:10:44,764 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:10:44,764 INFO L133 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91fda61e05234dbe68b069d372f5d4b0bb73b229 [2019-01-01 22:10:44,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:10:44,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:10:44,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:10:44,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:10:44,829 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:10:44,829 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2019-01-01 22:10:44,887 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d9c1387/0b387621604f4834bebb3d7bb6747f58/FLAG5ef048a46 [2019-01-01 22:10:45,399 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:10:45,400 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2019-01-01 22:10:45,409 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d9c1387/0b387621604f4834bebb3d7bb6747f58/FLAG5ef048a46 [2019-01-01 22:10:45,732 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d9c1387/0b387621604f4834bebb3d7bb6747f58 [2019-01-01 22:10:45,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:10:45,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:10:45,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:10:45,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:10:45,745 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:10:45,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:10:45" (1/1) ... [2019-01-01 22:10:45,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8c1856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:45, skipping insertion in model container [2019-01-01 22:10:45,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:10:45" (1/1) ... [2019-01-01 22:10:45,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:10:45,785 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:10:46,040 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:10:46,047 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:10:46,077 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:10:46,098 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:10:46,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46 WrapperNode [2019-01-01 22:10:46,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:10:46,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:10:46,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:10:46,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:10:46,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:10:46,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:10:46,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:10:46,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:10:46,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (1/1) ... [2019-01-01 22:10:46,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:10:46,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:10:46,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:10:46,186 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:10:46,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (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-01-01 22:10:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:10:46,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:10:46,782 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:10:46,782 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:10:46,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:10:46 BoogieIcfgContainer [2019-01-01 22:10:46,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:10:46,784 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:10:46,784 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:10:46,789 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:10:46,790 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:10:46,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:10:45" (1/3) ... [2019-01-01 22:10:46,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d577348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:10:46, skipping insertion in model container [2019-01-01 22:10:46,791 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:10:46,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:46" (2/3) ... [2019-01-01 22:10:46,793 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d577348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:10:46, skipping insertion in model container [2019-01-01 22:10:46,793 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:10:46,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:10:46" (3/3) ... [2019-01-01 22:10:46,795 INFO L375 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1b_true-unreach-call_false-termination.cil.c [2019-01-01 22:10:46,880 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:10:46,881 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:10:46,881 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:10:46,881 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:10:46,882 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:10:46,882 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:10:46,882 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:10:46,882 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:10:46,882 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:10:46,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-01-01 22:10:46,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 22:10:46,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:46,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:46,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:10:46,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:10:46,934 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:10:46,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-01-01 22:10:46,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 22:10:46,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:46,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:46,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:10:46,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:10:46,947 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 24#L100true [2019-01-01 22:10:46,947 INFO L796 eck$LassoCheckResult]: Loop: 24#L100true assume !false; 8#L19true assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22#L25true assume 8466 == main_~s__state~0; 4#L26true assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; 23#L58-1true assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 24#L100true [2019-01-01 22:10:46,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 22:10:46,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:46,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:47,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:47,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:47,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:47,072 INFO L82 PathProgramCache]: Analyzing trace with hash 38329778, now seen corresponding path program 1 times [2019-01-01 22:10:47,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:47,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:47,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:47,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:47,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 925833459, now seen corresponding path program 1 times [2019-01-01 22:10:47,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:47,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:47,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:47,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:47,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:47,214 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2019-01-01 22:10:47,253 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:47,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:47,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:47,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:47,254 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:47,255 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:47,255 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:47,255 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:47,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration1_Loop [2019-01-01 22:10:47,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:47,257 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:47,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,557 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 22:10:47,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:47,711 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:47,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:47,716 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:47,725 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:10:47,726 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0=7} Honda state: {ULTIMATE.start_main_~s__hit~0=7} 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:47,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:47,750 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 22:10:47,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:47,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:47,793 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:47,810 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:47,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:47,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:47,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:47,810 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:47,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:47,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:47,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:47,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration1_Loop [2019-01-01 22:10:47,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:47,811 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:47,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,972 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:47,979 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:47,981 INFO L122 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-01-01 22:10:47,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:47,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:47,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:47,983 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:10:47,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:47,987 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:10:47,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:47,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:10:47,992 INFO L122 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-01-01 22:10:47,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:47,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:47,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:47,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:47,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:47,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:47,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:48,002 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:48,008 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:48,008 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:48,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:48,011 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:48,011 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:48,011 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~blastFlag~0) = -1*ULTIMATE.start_main_~blastFlag~0 + 1 Supporting invariants [] [2019-01-01 22:10:48,013 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:48,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:48,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:48,277 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-01-01 22:10:48,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2019-01-01 22:10:48,401 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 51 states and 83 transitions. Complement of second has 5 states. [2019-01-01 22:10:48,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:10:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2019-01-01 22:10:48,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 1 letters. Loop has 5 letters. [2019-01-01 22:10:48,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:48,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-01 22:10:48,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:48,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 1 letters. Loop has 10 letters. [2019-01-01 22:10:48,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:48,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 83 transitions. [2019-01-01 22:10:48,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 22:10:48,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 58 transitions. [2019-01-01 22:10:48,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 22:10:48,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 22:10:48,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 58 transitions. [2019-01-01 22:10:48,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:48,424 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 58 transitions. [2019-01-01 22:10:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 58 transitions. [2019-01-01 22:10:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-01-01 22:10:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 22:10:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-01-01 22:10:48,458 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-01-01 22:10:48,458 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-01-01 22:10:48,458 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:10:48,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 56 transitions. [2019-01-01 22:10:48,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 22:10:48,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:48,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:48,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:10:48,461 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:10:48,461 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 149#L100 assume !false; 134#L19 [2019-01-01 22:10:48,461 INFO L796 eck$LassoCheckResult]: Loop: 134#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 135#L25 assume 8466 == main_~s__state~0; 119#L26 assume !(0 == main_~blastFlag~0); 120#L58-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 125#L100 assume !false; 134#L19 [2019-01-01 22:10:48,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:48,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 22:10:48,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:48,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash 43059010, now seen corresponding path program 1 times [2019-01-01 22:10:48,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:48,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:48,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:48,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1363931911, now seen corresponding path program 1 times [2019-01-01 22:10:48,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:48,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:48,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:48,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:48,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:48,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:10:48,607 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:48,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:48,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:48,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:48,608 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:48,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:48,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:48,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:48,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2019-01-01 22:10:48,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:48,608 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:48,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:48,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:48,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:49,057 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-01 22:10:49,133 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:49,133 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 22:10:49,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:49,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:49,158 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:10:49,158 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0=7} Honda state: {ULTIMATE.start_main_~s__hit~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:49,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:49,183 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:49,188 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:10:49,188 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~blastFlag~0=-8} Honda state: {ULTIMATE.start_main_~blastFlag~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:49,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:49,211 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:49,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:49,240 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:49,247 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:49,264 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:49,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:49,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:49,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:49,264 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:49,265 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:49,265 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:49,265 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:49,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2019-01-01 22:10:49,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:49,266 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:49,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:49,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:49,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-01-01 22:10:49,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:49,470 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:49,470 INFO L122 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-01-01 22:10:49,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:49,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:49,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:49,476 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:10:49,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:49,477 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:10:49,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:49,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:10:49,480 INFO L122 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-01-01 22:10:49,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:49,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:49,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:49,482 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:10:49,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:49,483 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:10:49,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:49,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:10:49,491 INFO L122 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-01-01 22:10:49,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:49,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:49,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:49,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:49,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:49,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:49,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:49,503 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:49,509 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:49,510 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:49,510 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:49,510 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:49,510 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:49,510 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8561 Supporting invariants [] [2019-01-01 22:10:49,512 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:49,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:49,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:49,643 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-01-01 22:10:49,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 56 transitions. cyclomatic complexity: 23 Second operand 5 states. [2019-01-01 22:10:49,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 56 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 103 states and 154 transitions. Complement of second has 7 states. [2019-01-01 22:10:49,762 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-01-01 22:10:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:10:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-01 22:10:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-01 22:10:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 22:10:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-01 22:10:49,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:49,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 154 transitions. [2019-01-01 22:10:49,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 22:10:49,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 76 states and 120 transitions. [2019-01-01 22:10:49,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-01 22:10:49,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 22:10:49,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 120 transitions. [2019-01-01 22:10:49,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:49,772 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 120 transitions. [2019-01-01 22:10:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 120 transitions. [2019-01-01 22:10:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2019-01-01 22:10:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 22:10:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 85 transitions. [2019-01-01 22:10:49,778 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 85 transitions. [2019-01-01 22:10:49,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:49,784 INFO L87 Difference]: Start difference. First operand 53 states and 85 transitions. Second operand 3 states. [2019-01-01 22:10:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:49,846 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-01-01 22:10:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:49,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 127 transitions. [2019-01-01 22:10:49,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 22:10:49,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 86 states and 124 transitions. [2019-01-01 22:10:49,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-01 22:10:49,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-01 22:10:49,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 124 transitions. [2019-01-01 22:10:49,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:49,854 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 124 transitions. [2019-01-01 22:10:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 124 transitions. [2019-01-01 22:10:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-01-01 22:10:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-01 22:10:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2019-01-01 22:10:49,863 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 122 transitions. [2019-01-01 22:10:49,863 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 122 transitions. [2019-01-01 22:10:49,863 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:10:49,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 122 transitions. [2019-01-01 22:10:49,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 22:10:49,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:49,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:49,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:10:49,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:10:49,868 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 477#L100 assume !false; 461#L19 [2019-01-01 22:10:49,868 INFO L796 eck$LassoCheckResult]: Loop: 461#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 462#L25 assume !(8466 == main_~s__state~0); 468#L30 assume 8512 == main_~s__state~0; 469#L31 main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; 451#L70 assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; 452#L100 assume !false; 461#L19 [2019-01-01 22:10:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 2 times [2019-01-01 22:10:49,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1336146262, now seen corresponding path program 1 times [2019-01-01 22:10:49,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:49,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:10:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:49,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:49,884 INFO L82 PathProgramCache]: Analyzing trace with hash 669100671, now seen corresponding path program 1 times [2019-01-01 22:10:49,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:49,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:49,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:49,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:49,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:49,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:10:50,013 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:50,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:50,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:50,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:50,014 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:50,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:50,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:50,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2019-01-01 22:10:50,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:50,015 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:50,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,131 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:50,132 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:50,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:50,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:10:50,151 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=-8, ULTIMATE.start_main_~tmp___1~0=-8} Honda state: {ULTIMATE.start_main_#t~nondet1=-8, ULTIMATE.start_main_~tmp___1~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:50,182 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,225 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:50,225 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:50,239 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:50,257 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:50,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:50,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:50,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:50,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:50,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:50,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:50,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2019-01-01 22:10:50,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:50,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:50,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,415 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:50,415 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:50,417 INFO L122 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-01-01 22:10:50,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:50,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:50,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:50,418 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:10:50,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:50,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:10:50,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:50,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:10:50,436 INFO L122 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-01-01 22:10:50,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:50,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:50,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:50,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:50,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:50,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:50,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:50,449 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:50,453 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:50,454 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:10:50,454 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:50,454 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:50,455 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:50,455 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = 1*ULTIMATE.start_main_~s__state~0 Supporting invariants [] [2019-01-01 22:10:50,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:50,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:50,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:50,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-01-01 22:10:50,588 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-01-01 22:10:50,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 122 transitions. cyclomatic complexity: 44 Second operand 5 states. [2019-01-01 22:10:50,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 122 transitions. cyclomatic complexity: 44. Second operand 5 states. Result 169 states and 231 transitions. Complement of second has 9 states. [2019-01-01 22:10:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:10:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:10:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2019-01-01 22:10:50,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 22:10:50,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:50,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 22:10:50,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:50,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-01 22:10:50,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:50,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 231 transitions. [2019-01-01 22:10:50,879 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 22:10:50,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 140 states and 195 transitions. [2019-01-01 22:10:50,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-01-01 22:10:50,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-01-01 22:10:50,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 195 transitions. [2019-01-01 22:10:50,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:50,882 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 195 transitions. [2019-01-01 22:10:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 195 transitions. [2019-01-01 22:10:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 104. [2019-01-01 22:10:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 22:10:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2019-01-01 22:10:50,893 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 22:10:50,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:50,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:50,894 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 3 states. [2019-01-01 22:10:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:50,931 INFO L93 Difference]: Finished difference Result 64 states and 93 transitions. [2019-01-01 22:10:50,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:50,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 93 transitions. [2019-01-01 22:10:50,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-01-01 22:10:50,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 60 states and 89 transitions. [2019-01-01 22:10:50,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 22:10:50,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 22:10:50,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 89 transitions. [2019-01-01 22:10:50,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:50,937 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 89 transitions. [2019-01-01 22:10:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 89 transitions. [2019-01-01 22:10:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-01 22:10:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 22:10:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2019-01-01 22:10:50,945 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 89 transitions. [2019-01-01 22:10:50,945 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 89 transitions. [2019-01-01 22:10:50,945 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:10:50,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 89 transitions. [2019-01-01 22:10:50,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-01-01 22:10:50,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:50,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:50,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 22:10:50,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:10:50,948 INFO L794 eck$LassoCheckResult]: Stem: 952#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 953#L100 assume !false; 942#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 943#L25 assume 8466 == main_~s__state~0; 924#L26 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; 925#L58-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 963#L100 assume !false; 962#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 954#L25 assume !(8466 == main_~s__state~0); 944#L30 [2019-01-01 22:10:50,948 INFO L796 eck$LassoCheckResult]: Loop: 944#L30 assume 8512 == main_~s__state~0; 945#L31 main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; 926#L70 assume !(0 != main_~tmp___1~0);main_~s__state~0 := 8640; 928#L100 assume !false; 961#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 960#L25 assume !(8466 == main_~s__state~0); 944#L30 [2019-01-01 22:10:50,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:50,949 INFO L82 PathProgramCache]: Analyzing trace with hash -775328166, now seen corresponding path program 1 times [2019-01-01 22:10:50,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:50,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1593798804, now seen corresponding path program 1 times [2019-01-01 22:10:50,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:50,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:50,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:50,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:50,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:50,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1200158765, now seen corresponding path program 1 times [2019-01-01 22:10:50,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:50,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,030 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:51,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:51,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:51,030 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:51,030 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:51,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:51,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:51,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:51,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration4_Loop [2019-01-01 22:10:51,031 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:51,031 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:51,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:51,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:51,092 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:51,093 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 22:10:51,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:51,101 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 22:10:51,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:51,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:51,136 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:51,153 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:51,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:51,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:51,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:51,154 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:51,154 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:51,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:51,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:51,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b_true-unreach-call_false-termination.cil.c_Iteration4_Loop [2019-01-01 22:10:51,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:51,155 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:51,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:51,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:51,226 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:51,226 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:51,226 INFO L122 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-01-01 22:10:51,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:51,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:51,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:51,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:51,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:51,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:51,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:51,234 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:51,238 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:51,238 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:51,239 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:51,239 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:51,239 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:51,239 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8576 Supporting invariants [] [2019-01-01 22:10:51,239 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:51,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:51,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:51,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:51,341 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-01-01 22:10:51,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 89 transitions. cyclomatic complexity: 33 Second operand 4 states. [2019-01-01 22:10:51,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 89 transitions. cyclomatic complexity: 33. Second operand 4 states. Result 182 states and 280 transitions. Complement of second has 9 states. [2019-01-01 22:10:51,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:10:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2019-01-01 22:10:51,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:10:51,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:51,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 22:10:51,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:51,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 9 letters. Loop has 12 letters. [2019-01-01 22:10:51,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:51,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 280 transitions. [2019-01-01 22:10:51,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2019-01-01 22:10:51,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 162 states and 244 transitions. [2019-01-01 22:10:51,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-01-01 22:10:51,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-01-01 22:10:51,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 244 transitions. [2019-01-01 22:10:51,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:51,548 INFO L705 BuchiCegarLoop]: Abstraction has 162 states and 244 transitions. [2019-01-01 22:10:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 244 transitions. [2019-01-01 22:10:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2019-01-01 22:10:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-01 22:10:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2019-01-01 22:10:51,557 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 182 transitions. [2019-01-01 22:10:51,557 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 182 transitions. [2019-01-01 22:10:51,557 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:10:51,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 182 transitions. [2019-01-01 22:10:51,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 22:10:51,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:51,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:51,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:51,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:51,559 INFO L794 eck$LassoCheckResult]: Stem: 1266#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~s__state~0, main_~s__hit~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 1267#L100 assume !false; 1313#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1314#L25 assume 8466 == main_~s__state~0; 1309#L26 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 2; 1307#L58-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 1285#L100 assume !false; 1282#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1272#L25 assume !(8466 == main_~s__state~0); 1273#L30 assume 8512 == main_~s__state~0; 1262#L31 [2019-01-01 22:10:51,560 INFO L796 eck$LassoCheckResult]: Loop: 1262#L31 main_~tmp___1~0 := main_#t~nondet1;havoc main_#t~nondet1; 1243#L70 assume 0 != main_~tmp___1~0;main_~s__state~0 := 8466; 1244#L100 assume !false; 1255#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1256#L25 assume 8466 == main_~s__state~0; 1238#L26 assume !(0 == main_~blastFlag~0); 1239#L58-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 1301#L100 assume !false; 1293#L19 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1289#L25 assume !(8466 == main_~s__state~0); 1261#L30 assume 8512 == main_~s__state~0; 1262#L31 [2019-01-01 22:10:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:51,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1734630653, now seen corresponding path program 1 times [2019-01-01 22:10:51,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:51,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:51,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:51,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1859066665, now seen corresponding path program 1 times [2019-01-01 22:10:51,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:51,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash -845557157, now seen corresponding path program 1 times [2019-01-01 22:10:51,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:51,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:51,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:52,064 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-01 22:10:52,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:10:52 BoogieIcfgContainer [2019-01-01 22:10:52,094 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:10:52,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:10:52,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:10:52,095 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:10:52,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:10:46" (3/4) ... [2019-01-01 22:10:52,098 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:10:52,155 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:10:52,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:10:52,160 INFO L168 Benchmark]: Toolchain (without parser) took 6423.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -257.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:10:52,162 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:10:52,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.54 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:52,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.74 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:10:52,163 INFO L168 Benchmark]: Boogie Preprocessor took 42.74 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:52,163 INFO L168 Benchmark]: RCFGBuilder took 597.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:52,166 INFO L168 Benchmark]: BuchiAutomizer took 5310.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.2 MB). Peak memory consumption was 314.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:52,167 INFO L168 Benchmark]: Witness Printer took 64.82 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:52,176 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.54 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 42.74 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.74 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 597.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5310.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.2 MB). Peak memory consumption was 314.1 MB. Max. memory is 11.5 GB. * Witness Printer took 64.82 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. 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 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * blastFlag + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8561 and consists of 4 locations. One deterministic module has affine ranking function s__state and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8576 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 124 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 101 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 124 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 143 SDtfs, 145 SDslu, 114 SDs, 0 SdLazy, 176 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf97 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq191 hnf89 smp100 dnf119 smp94 tf112 neg98 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 30]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@553d266e=0, \result=0, tmp___1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a84fad=1, s__hit=0, blastFlag=2, s__state=8512} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int s__state ; [L11] int s__hit = __VERIFIER_nondet_int() ; [L12] int blastFlag ; [L13] int tmp___1; [L15] s__state = 8466 [L16] blastFlag = 0 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND TRUE blastFlag == 0 [L59] blastFlag = 2 [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 Loop: [L69] tmp___1 = __VERIFIER_nondet_int() [L70] COND TRUE \read(tmp___1) [L71] s__state = 8466 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND TRUE s__state == 8466 [L58] COND FALSE !(blastFlag == 0) [L61] COND FALSE !(\read(s__hit)) [L64] s__state = 8512 [L18] COND TRUE 1 [L19] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L25] COND FALSE !(s__state == 8466) [L30] COND TRUE s__state == 8512 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...