./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/n.c11_true-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/loops/n.c11_true-unreach-call_false-termination.i -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 24b22c477e8a47eac290a2fc1c5b1e1aaa3a4fa4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-14 03:39:29,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:39:29,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:39:29,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:39:29,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:39:29,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:39:29,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:39:29,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:39:29,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:39:29,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:39:29,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:39:29,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:39:29,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:39:29,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:39:29,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:39:29,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:39:29,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:39:29,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:39:29,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:39:29,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:39:29,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:39:29,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:39:29,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:39:29,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:39:29,761 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:39:29,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:39:29,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:39:29,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:39:29,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:39:29,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:39:29,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:39:29,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:39:29,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:39:29,767 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:39:29,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:39:29,768 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:39:29,769 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:39:29,786 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:39:29,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:39:29,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:39:29,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:39:29,788 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:39:29,789 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:39:29,789 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:39:29,789 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:39:29,789 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:39:29,789 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:39:29,789 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:39:29,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:39:29,790 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:39:29,790 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:39:29,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:39:29,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:39:29,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:39:29,791 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:39:29,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:39:29,791 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:39:29,791 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:39:29,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:39:29,791 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:39:29,792 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:39:29,792 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:39:29,792 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:39:29,792 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:39:29,792 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:39:29,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:39:29,793 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:39:29,793 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:39:29,794 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:39:29,794 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 -> 24b22c477e8a47eac290a2fc1c5b1e1aaa3a4fa4 [2019-01-14 03:39:29,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:39:29,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:39:29,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:39:29,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:39:29,885 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:39:29,886 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/n.c11_true-unreach-call_false-termination.i [2019-01-14 03:39:29,955 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704662829/d04ff23cd45041ccab314c02c3021ea3/FLAGa656beb27 [2019-01-14 03:39:30,403 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:39:30,404 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/n.c11_true-unreach-call_false-termination.i [2019-01-14 03:39:30,409 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704662829/d04ff23cd45041ccab314c02c3021ea3/FLAGa656beb27 [2019-01-14 03:39:30,794 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704662829/d04ff23cd45041ccab314c02c3021ea3 [2019-01-14 03:39:30,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:39:30,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:39:30,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:39:30,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:39:30,809 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:39:30,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:39:30" (1/1) ... [2019-01-14 03:39:30,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694eaae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:30, skipping insertion in model container [2019-01-14 03:39:30,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:39:30" (1/1) ... [2019-01-14 03:39:30,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:39:30,845 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:39:31,091 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:39:31,097 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:39:31,117 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:39:31,136 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:39:31,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31 WrapperNode [2019-01-14 03:39:31,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:39:31,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:39:31,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:39:31,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:39:31,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:39:31,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:39:31,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:39:31,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:39:31,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (1/1) ... [2019-01-14 03:39:31,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:39:31,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:39:31,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:39:31,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:39:31,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (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-14 03:39:31,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:39:31,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:39:31,633 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:39:31,634 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 03:39:31,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:31 BoogieIcfgContainer [2019-01-14 03:39:31,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:39:31,636 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:39:31,636 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:39:31,640 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:39:31,641 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:31,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:39:30" (1/3) ... [2019-01-14 03:39:31,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@321c2256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:39:31, skipping insertion in model container [2019-01-14 03:39:31,643 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:31,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:31" (2/3) ... [2019-01-14 03:39:31,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@321c2256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:39:31, skipping insertion in model container [2019-01-14 03:39:31,643 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:31,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:31" (3/3) ... [2019-01-14 03:39:31,646 INFO L375 chiAutomizerObserver]: Analyzing ICFG n.c11_true-unreach-call_false-termination.i [2019-01-14 03:39:31,707 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:39:31,708 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:39:31,708 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:39:31,708 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:39:31,709 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:39:31,709 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:39:31,709 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:39:31,709 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:39:31,710 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:39:31,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 03:39:31,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:39:31,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:31,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:31,791 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 03:39:31,795 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:39:31,795 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:39:31,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 03:39:31,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:39:31,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:31,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:31,800 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 03:39:31,800 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:39:31,820 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 5#L13-2true [2019-01-14 03:39:31,821 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-2true assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 11#L14true assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 7#L14-2true assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 5#L13-2true [2019-01-14 03:39:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:31,836 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 03:39:31,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:31,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:31,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:31,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:31,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2019-01-14 03:39:31,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:31,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:31,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:31,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:31,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2019-01-14 03:39:31,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:31,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:31,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:31,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:31,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:32,152 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-14 03:39:32,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:32,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:39:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:39:32,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:39:32,299 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-14 03:39:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:32,357 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-14 03:39:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:39:32,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-01-14 03:39:32,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:39:32,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2019-01-14 03:39:32,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 03:39:32,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 03:39:32,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-14 03:39:32,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:32,369 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 03:39:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-14 03:39:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-14 03:39:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 03:39:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 03:39:32,396 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 03:39:32,396 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 03:39:32,396 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:39:32,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-14 03:39:32,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:39:32,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:32,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:32,399 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:39:32,399 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:39:32,399 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 44#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 48#L14 assume !(4 == main_~len~0 % 4294967296); 47#L14-2 [2019-01-14 03:39:32,399 INFO L796 eck$LassoCheckResult]: Loop: 47#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 45#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 46#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 47#L14-2 [2019-01-14 03:39:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:32,400 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-14 03:39:32,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:32,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:32,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:32,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2019-01-14 03:39:32,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:32,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:32,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:32,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:32,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2019-01-14 03:39:32,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:32,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:32,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:32,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:39:32,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:39:32,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:32,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:32,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:39:32,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-01-14 03:39:33,003 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-01-14 03:39:33,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:39:33,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:39:33,069 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-01-14 03:39:33,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:33,109 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-14 03:39:33,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:39:33,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-01-14 03:39:33,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 03:39:33,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-01-14 03:39:33,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 03:39:33,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 03:39:33,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-01-14 03:39:33,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:33,114 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-14 03:39:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-01-14 03:39:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-14 03:39:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 03:39:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-14 03:39:33,116 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-14 03:39:33,116 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-14 03:39:33,116 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:39:33,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-01-14 03:39:33,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 03:39:33,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:33,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:33,118 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:39:33,118 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-01-14 03:39:33,118 INFO L794 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 85#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 92#L14 assume !(4 == main_~len~0 % 4294967296); 88#L14-2 [2019-01-14 03:39:33,118 INFO L796 eck$LassoCheckResult]: Loop: 88#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 86#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 87#L14 assume !(4 == main_~len~0 % 4294967296); 89#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 91#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 90#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 88#L14-2 [2019-01-14 03:39:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2019-01-14 03:39:33,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2019-01-14 03:39:33,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:33,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2019-01-14 03:39:33,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:33,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:33,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:33,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:33,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:39:33,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:39:33,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:39:33,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:39:33,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:39:33,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:33,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:39:33,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-14 03:39:33,696 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-01-14 03:39:33,868 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-01-14 03:39:33,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:39:33,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:39:33,869 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-14 03:39:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:33,940 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-14 03:39:33,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:39:33,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-01-14 03:39:33,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 03:39:33,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-01-14 03:39:33,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 03:39:33,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 03:39:33,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-01-14 03:39:33,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:33,946 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-14 03:39:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-01-14 03:39:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-14 03:39:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 03:39:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-14 03:39:33,950 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 03:39:33,950 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 03:39:33,950 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:39:33,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-01-14 03:39:33,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 03:39:33,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:33,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:33,953 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:39:33,953 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-01-14 03:39:33,953 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 142#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 152#L14 assume !(4 == main_~len~0 % 4294967296); 145#L14-2 [2019-01-14 03:39:33,953 INFO L796 eck$LassoCheckResult]: Loop: 145#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 143#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 144#L14 assume !(4 == main_~len~0 % 4294967296); 150#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 151#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 146#L14 assume !(4 == main_~len~0 % 4294967296); 147#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 148#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 145#L14-2 [2019-01-14 03:39:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:33,956 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-01-14 03:39:33,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:33,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:33,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:33,968 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2019-01-14 03:39:33,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:33,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:33,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:33,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2019-01-14 03:39:34,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:34,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:34,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:34,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:39:34,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:39:34,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 03:39:34,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 03:39:34,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:39:34,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:34,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:39:34,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 03:39:35,062 WARN L181 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-01-14 03:39:35,508 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-01-14 03:39:35,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 03:39:35,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 03:39:35,510 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-01-14 03:39:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:35,580 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-01-14 03:39:35,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 03:39:35,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-01-14 03:39:35,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-14 03:39:35,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-01-14 03:39:35,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 03:39:35,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 03:39:35,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-01-14 03:39:35,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:35,583 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-14 03:39:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-01-14 03:39:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-14 03:39:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 03:39:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-14 03:39:35,587 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-14 03:39:35,587 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-14 03:39:35,587 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:39:35,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-01-14 03:39:35,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 03:39:35,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:35,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:35,589 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:39:35,589 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-01-14 03:39:35,589 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 215#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 216#L14 assume !(4 == main_~len~0 % 4294967296); 217#L14-2 [2019-01-14 03:39:35,589 INFO L796 eck$LassoCheckResult]: Loop: 217#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 228#L14 assume !(4 == main_~len~0 % 4294967296); 227#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 226#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 225#L14 assume !(4 == main_~len~0 % 4294967296); 224#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 222#L14 assume !(4 == main_~len~0 % 4294967296); 220#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 221#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 219#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 217#L14-2 [2019-01-14 03:39:35,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:35,590 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2019-01-14 03:39:35,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:35,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:35,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2019-01-14 03:39:35,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:35,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:35,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:35,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:35,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:35,645 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2019-01-14 03:39:35,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:35,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:35,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:37,315 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-01-14 03:39:40,138 WARN L181 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2019-01-14 03:39:40,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:39:40 BoogieIcfgContainer [2019-01-14 03:39:40,198 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:39:40,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:39:40,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:39:40,199 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:39:40,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:31" (3/4) ... [2019-01-14 03:39:40,203 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 03:39:40,256 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 03:39:40,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:39:40,257 INFO L168 Benchmark]: Toolchain (without parser) took 9454.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 951.4 MB in the beginning and 897.1 MB in the end (delta: 54.3 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:40,259 INFO L168 Benchmark]: CDTParser took 0.20 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-14 03:39:40,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.63 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:40,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.48 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:39:40,261 INFO L168 Benchmark]: Boogie Preprocessor took 33.31 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:40,262 INFO L168 Benchmark]: RCFGBuilder took 419.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:40,263 INFO L168 Benchmark]: BuchiAutomizer took 8562.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.1 MB in the end (delta: 199.6 MB). Peak memory consumption was 199.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:39:40,265 INFO L168 Benchmark]: Witness Printer took 57.37 ms. Allocated memory is still 1.2 GB. Free memory is still 897.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:39:40,269 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.20 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 331.63 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.48 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.31 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 419.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8562.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.1 MB in the end (delta: 199.6 MB). Peak memory consumption was 199.6 MB. Max. memory is 11.5 GB. * Witness Printer took 57.37 ms. Allocated memory is still 1.2 GB. Free memory is still 897.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 8.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 18 SDslu, 30 SDs, 0 SdLazy, 84 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: 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 {len=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fefa88=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1c56b115=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 14]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int a[5]; [L11] unsigned int len=0; [L12] int i; [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) Loop: [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND TRUE len==4 [L15] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...