./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/nec11_false-unreach-call_false-termination.i --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/loops/nec11_false-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 377e57d4a3daf9b967866e1410a183dc7f79915c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:57:45,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:57:45,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:57:45,173 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:57:45,173 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:57:45,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:57:45,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:57:45,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:57:45,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:57:45,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:57:45,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:57:45,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:57:45,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:57:45,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:57:45,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:57:45,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:57:45,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:57:45,205 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:57:45,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:57:45,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:57:45,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:57:45,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:57:45,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:57:45,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:57:45,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:57:45,230 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:57:45,231 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:57:45,234 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:57:45,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:57:45,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:57:45,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:57:45,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:57:45,239 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:57:45,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:57:45,240 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:57:45,241 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:57:45,241 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:57:45,263 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:57:45,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:57:45,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:57:45,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:57:45,265 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:57:45,265 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:57:45,266 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:57:45,266 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:57:45,266 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:57:45,266 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:57:45,266 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:57:45,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:57:45,268 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:57:45,268 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:57:45,268 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:57:45,268 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:57:45,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:57:45,269 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:57:45,269 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:57:45,269 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:57:45,269 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:57:45,269 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:57:45,269 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:57:45,271 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:57:45,271 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:57:45,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:57:45,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:57:45,272 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:57:45,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:57:45,272 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:57:45,273 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:57:45,274 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:57:45,274 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 -> 377e57d4a3daf9b967866e1410a183dc7f79915c [2019-01-01 22:57:45,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:57:45,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:57:45,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:57:45,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:57:45,339 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:57:45,340 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/nec11_false-unreach-call_false-termination.i [2019-01-01 22:57:45,423 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464dd1ad6/9648da2dda85497c82da8e276edd7060/FLAG97b1d28f3 [2019-01-01 22:57:45,845 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:57:45,846 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/nec11_false-unreach-call_false-termination.i [2019-01-01 22:57:45,852 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464dd1ad6/9648da2dda85497c82da8e276edd7060/FLAG97b1d28f3 [2019-01-01 22:57:46,209 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464dd1ad6/9648da2dda85497c82da8e276edd7060 [2019-01-01 22:57:46,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:57:46,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:57:46,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:57:46,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:57:46,221 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:57:46,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19de7f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46, skipping insertion in model container [2019-01-01 22:57:46,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:57:46,258 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:57:46,507 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:57:46,516 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:57:46,535 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:57:46,554 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:57:46,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46 WrapperNode [2019-01-01 22:57:46,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:57:46,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:57:46,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:57:46,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:57:46,567 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:57:46" (1/1) ... [2019-01-01 22:57:46,574 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:57:46" (1/1) ... [2019-01-01 22:57:46,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:57:46,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:57:46,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:57:46,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:57:46,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46" (1/1) ... [2019-01-01 22:57:46,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:57:46,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:57:46,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:57:46,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:57:46,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57: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:57:46,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:57:46,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:57:46,999 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:57:47,000 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 22:57:47,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:47 BoogieIcfgContainer [2019-01-01 22:57:47,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:57:47,001 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:57:47,001 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:57:47,005 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:57:47,006 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:47,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:57:46" (1/3) ... [2019-01-01 22:57:47,008 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17bd0296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:57:47, skipping insertion in model container [2019-01-01 22:57:47,008 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:47,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:46" (2/3) ... [2019-01-01 22:57:47,008 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17bd0296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:57:47, skipping insertion in model container [2019-01-01 22:57:47,008 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:47,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:47" (3/3) ... [2019-01-01 22:57:47,011 INFO L375 chiAutomizerObserver]: Analyzing ICFG nec11_false-unreach-call_false-termination.i [2019-01-01 22:57:47,071 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:57:47,072 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:57:47,072 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:57:47,072 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:57:47,072 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:57:47,072 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:57:47,073 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:57:47,073 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:57:47,073 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:57:47,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 22:57:47,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:57:47,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:47,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:47,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:57:47,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:47,122 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:57:47,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 22:57:47,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:57:47,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:47,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:47,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:57:47,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:47,133 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 7#L19-2true [2019-01-01 22:57:47,134 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(0 != main_~c~0 % 256); 3#L21true assume 4 == main_~len~0;main_~len~0 := 0; 11#L21-2true assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L19-2true [2019-01-01 22:57:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:47,140 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 22:57:47,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:47,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:47,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:47,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:47,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2019-01-01 22:57:47,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:47,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:47,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:47,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2019-01-01 22:57:47,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:47,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:47,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:47,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:47,356 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:57:47,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:47,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:57:47,590 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-01-01 22:57:47,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:57:47,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:57:47,647 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-01 22:57:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:47,697 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-01 22:57:47,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:57:47,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-01-01 22:57:47,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:57:47,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2019-01-01 22:57:47,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 22:57:47,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 22:57:47,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-01 22:57:47,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:47,710 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 22:57:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-01 22:57:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-01 22:57:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 22:57:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 22:57:47,742 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 22:57:47,742 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 22:57:47,742 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:57:47,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-01 22:57:47,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:57:47,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:47,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:47,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:57:47,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:47,744 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 46#L19-2 assume !!(0 != main_~c~0 % 256); 43#L21 assume !(4 == main_~len~0); 44#L21-2 [2019-01-01 22:57:47,744 INFO L796 eck$LassoCheckResult]: Loop: 44#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 47#L19-2 assume !!(0 != main_~c~0 % 256); 48#L21 assume 4 == main_~len~0;main_~len~0 := 0; 44#L21-2 [2019-01-01 22:57:47,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-01 22:57:47,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:47,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:47,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:47,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2019-01-01 22:57:47,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:47,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:47,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:47,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2019-01-01 22:57:47,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:47,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:47,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:47,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:47,941 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-01 22:57:47,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:57:47,941 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-01 22:57:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:47,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:48,017 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-01 22:57:48,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:57:48,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-01 22:57:48,278 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-01-01 22:57:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:57:48,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:57:48,304 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-01-01 22:57:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:48,353 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-01 22:57:48,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:57:48,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-01-01 22:57:48,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 22:57:48,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-01-01 22:57:48,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:57:48,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:57:48,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-01-01 22:57:48,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:48,357 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-01 22:57:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-01-01 22:57:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-01 22:57:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 22:57:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-01 22:57:48,360 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-01 22:57:48,360 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-01 22:57:48,361 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:57:48,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-01-01 22:57:48,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 22:57:48,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:48,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:48,363 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:57:48,363 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-01-01 22:57:48,363 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 86#L19-2 assume !!(0 != main_~c~0 % 256); 91#L21 assume !(4 == main_~len~0); 88#L21-2 [2019-01-01 22:57:48,363 INFO L796 eck$LassoCheckResult]: Loop: 88#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 87#L19-2 assume !!(0 != main_~c~0 % 256); 83#L21 assume !(4 == main_~len~0); 84#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 90#L19-2 assume !!(0 != main_~c~0 % 256); 89#L21 assume 4 == main_~len~0;main_~len~0 := 0; 88#L21-2 [2019-01-01 22:57:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2019-01-01 22:57:48,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2019-01-01 22:57:48,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:48,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2019-01-01 22:57:48,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:48,596 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-01 22:57:48,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:57:48,596 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-01 22:57:48,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:57:48,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:57:48,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:57:48,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:48,654 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-01 22:57:48,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:57:48,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 22:57:48,841 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-01-01 22:57:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:57:48,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:57:48,860 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-01-01 22:57:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:48,886 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-01 22:57:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:57:48,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-01-01 22:57:48,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 22:57:48,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-01-01 22:57:48,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 22:57:48,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:57:48,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-01-01 22:57:48,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:48,891 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-01 22:57:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-01-01 22:57:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 22:57:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 22:57:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-01 22:57:48,893 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-01 22:57:48,893 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-01 22:57:48,893 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:57:48,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-01-01 22:57:48,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 22:57:48,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:48,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:48,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:57:48,895 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-01-01 22:57:48,895 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 142#L19-2 assume !!(0 != main_~c~0 % 256); 150#L21 assume !(4 == main_~len~0); 145#L21-2 [2019-01-01 22:57:48,895 INFO L796 eck$LassoCheckResult]: Loop: 145#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 143#L19-2 assume !!(0 != main_~c~0 % 256); 144#L21 assume !(4 == main_~len~0); 148#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L19-2 assume !!(0 != main_~c~0 % 256); 139#L21 assume !(4 == main_~len~0); 140#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 147#L19-2 assume !!(0 != main_~c~0 % 256); 146#L21 assume 4 == main_~len~0;main_~len~0 := 0; 145#L21-2 [2019-01-01 22:57:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-01-01 22:57:48,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,904 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2019-01-01 22:57:48,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:48,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2019-01-01 22:57:48,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:49,016 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-01 22:57:49,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:57:49,017 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-01 22:57:49,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:57:49,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 22:57:49,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:57:49,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:57:49,046 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-01 22:57:49,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:57:49,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 22:57:49,310 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-01 22:57:49,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:57:49,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:57:49,340 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-01 22:57:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:49,383 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-01-01 22:57:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:57:49,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-01-01 22:57:49,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-01 22:57:49,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-01-01 22:57:49,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 22:57:49,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 22:57:49,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-01-01 22:57:49,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:49,388 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-01 22:57:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-01-01 22:57:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 22:57:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 22:57:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-01 22:57:49,390 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-01 22:57:49,390 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-01 22:57:49,391 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:57:49,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-01-01 22:57:49,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 22:57:49,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:49,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:49,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:57:49,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-01-01 22:57:49,393 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 214#L19-2 assume !!(0 != main_~c~0 % 256); 211#L21 assume !(4 == main_~len~0); 212#L21-2 [2019-01-01 22:57:49,393 INFO L796 eck$LassoCheckResult]: Loop: 212#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 215#L19-2 assume !!(0 != main_~c~0 % 256); 225#L21 assume !(4 == main_~len~0); 224#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L19-2 assume !!(0 != main_~c~0 % 256); 222#L21 assume !(4 == main_~len~0); 221#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 220#L19-2 assume !!(0 != main_~c~0 % 256); 219#L21 assume !(4 == main_~len~0); 217#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L19-2 assume !!(0 != main_~c~0 % 256); 216#L21 assume 4 == main_~len~0;main_~len~0 := 0; 212#L21-2 [2019-01-01 22:57:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2019-01-01 22:57:49,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:49,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:49,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:49,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:49,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2019-01-01 22:57:49,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:49,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:49,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:49,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:49,424 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2019-01-01 22:57:49,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:49,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:49,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:49,873 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-01-01 22:57:49,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:57:49 BoogieIcfgContainer [2019-01-01 22:57:49,976 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:57:49,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:57:49,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:57:49,976 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:57:49,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:47" (3/4) ... [2019-01-01 22:57:49,980 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:57:50,068 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:57:50,068 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:57:50,069 INFO L168 Benchmark]: Toolchain (without parser) took 3855.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.3 MB in the beginning and 976.5 MB in the end (delta: -33.2 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:50,070 INFO L168 Benchmark]: CDTParser took 0.19 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:57:50,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.09 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 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:57:50,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.31 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:57:50,075 INFO L168 Benchmark]: Boogie Preprocessor took 36.52 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:57:50,075 INFO L168 Benchmark]: RCFGBuilder took 359.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:50,076 INFO L168 Benchmark]: BuchiAutomizer took 2974.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.3 MB in the end (delta: 116.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:50,077 INFO L168 Benchmark]: Witness Printer took 92.01 ms. Allocated memory is still 1.2 GB. Free memory was 983.3 MB in the beginning and 976.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:50,088 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.19 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 339.09 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.31 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.52 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 359.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2974.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.3 MB in the end (delta: 116.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 11.5 GB. * Witness Printer took 92.01 ms. Allocated memory is still 1.2 GB. Free memory was 983.3 MB in the beginning and 976.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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 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 6 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 2.5s. 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: 18 SDtfs, 17 SDslu, 16 SDs, 0 SdLazy, 30 SolverSat, 9 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: 19]: 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@2df09e1f=0, \result=0, c=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2b5a1197=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) Loop: [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...