./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer --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 751def0588f132c393a8666a5acb62e8205c40a1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-aa41828 [2018-11-23 01:58:51,308 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:58:51,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:58:51,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:58:51,316 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:58:51,317 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:58:51,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:58:51,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:58:51,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:58:51,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:58:51,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:58:51,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:58:51,321 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:58:51,322 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:58:51,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:58:51,323 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:58:51,324 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:58:51,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:58:51,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:58:51,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:58:51,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:58:51,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:58:51,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:58:51,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:58:51,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:58:51,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:58:51,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:58:51,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:58:51,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:58:51,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:58:51,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:58:51,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:58:51,333 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:58:51,333 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:58:51,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:58:51,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:58:51,334 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 01:58:51,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:58:51,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:58:51,346 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:58:51,346 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:58:51,347 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:58:51,347 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 01:58:51,347 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 01:58:51,347 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 01:58:51,347 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 01:58:51,347 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 01:58:51,347 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 01:58:51,347 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:58:51,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:58:51,348 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:58:51,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:58:51,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:58:51,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:58:51,348 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 01:58:51,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 01:58:51,348 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 01:58:51,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:58:51,349 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:58:51,349 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 01:58:51,349 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:58:51,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 01:58:51,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:58:51,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:58:51,350 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 01:58:51,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:58:51,350 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:58:51,350 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 01:58:51,351 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 01:58:51,351 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer 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 -> 751def0588f132c393a8666a5acb62e8205c40a1 [2018-11-23 01:58:51,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:58:51,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:58:51,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:58:51,386 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:58:51,387 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:58:51,387 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-23 01:58:51,431 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/data/8eb41a83d/a574e85c53964989b2f2e8828ecc3e95/FLAGf6163a129 [2018-11-23 01:58:51,831 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:58:51,832 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-23 01:58:51,836 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/data/8eb41a83d/a574e85c53964989b2f2e8828ecc3e95/FLAGf6163a129 [2018-11-23 01:58:51,846 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/data/8eb41a83d/a574e85c53964989b2f2e8828ecc3e95 [2018-11-23 01:58:51,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:58:51,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:58:51,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:58:51,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:58:51,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:58:51,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:58:51" (1/1) ... [2018-11-23 01:58:51,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fae5e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:51, skipping insertion in model container [2018-11-23 01:58:51,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:58:51" (1/1) ... [2018-11-23 01:58:51,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:58:51,885 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:58:52,006 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:58:52,008 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:58:52,022 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:58:52,030 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:58:52,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52 WrapperNode [2018-11-23 01:58:52,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:58:52,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:58:52,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:58:52,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:58:52,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:58:52,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:58:52,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:58:52,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:58:52,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... [2018-11-23 01:58:52,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:58:52,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:58:52,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:58:52,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:58:52,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/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 [2018-11-23 01:58:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:58:52,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:58:52,325 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:58:52,325 INFO L280 CfgBuilder]: Removed 38 assue(true) statements. [2018-11-23 01:58:52,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:52 BoogieIcfgContainer [2018-11-23 01:58:52,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:58:52,325 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 01:58:52,325 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 01:58:52,328 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 01:58:52,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:58:52,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:58:51" (1/3) ... [2018-11-23 01:58:52,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44288c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:58:52, skipping insertion in model container [2018-11-23 01:58:52,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:58:52,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:58:52" (2/3) ... [2018-11-23 01:58:52,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44288c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:58:52, skipping insertion in model container [2018-11-23 01:58:52,330 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:58:52,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:52" (3/3) ... [2018-11-23 01:58:52,331 INFO L375 chiAutomizerObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-23 01:58:52,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:58:52,378 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 01:58:52,378 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 01:58:52,378 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 01:58:52,378 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:58:52,378 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:58:52,378 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 01:58:52,379 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:58:52,379 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 01:58:52,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states. [2018-11-23 01:58:52,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-23 01:58:52,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:58:52,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:58:52,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:58:52,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 01:58:52,407 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 01:58:52,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states. [2018-11-23 01:58:52,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-23 01:58:52,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:58:52,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:58:52,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:58:52,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 01:58:52,414 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1; 53#L17true assume !(main_~bufsize~0 < 0);main_~len~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; 39#L20-2true [2018-11-23 01:58:52,414 INFO L796 eck$LassoCheckResult]: Loop: 39#L20-2true assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; 55#L21-2true assume !true; 39#L20-2true [2018-11-23 01:58:52,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 1 times [2018-11-23 01:58:52,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:52,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:52,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:52,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:58:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:58:52,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:52,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1591, now seen corresponding path program 1 times [2018-11-23 01:58:52,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:52,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:52,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:52,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:58:52,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:52,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 01:58:52,512 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:58:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:58:52,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:58:52,523 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-11-23 01:58:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:52,529 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-23 01:58:52,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:58:52,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2018-11-23 01:58:52,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-23 01:58:52,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 38 states and 41 transitions. [2018-11-23 01:58:52,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 01:58:52,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 01:58:52,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 41 transitions. [2018-11-23 01:58:52,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:58:52,536 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-23 01:58:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 41 transitions. [2018-11-23 01:58:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 01:58:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 01:58:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-23 01:58:52,561 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-23 01:58:52,561 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-23 01:58:52,561 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 01:58:52,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 41 transitions. [2018-11-23 01:58:52,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-23 01:58:52,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:58:52,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:58:52,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 01:58:52,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 01:58:52,563 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L17 assume !(main_~bufsize~0 < 0);main_~len~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; 130#L20-2 [2018-11-23 01:58:52,563 INFO L796 eck$LassoCheckResult]: Loop: 130#L20-2 assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; 131#L21-2 assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); 130#L20-2 [2018-11-23 01:58:52,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:52,563 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 2 times [2018-11-23 01:58:52,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:52,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:52,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:52,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:58:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:58:52,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1415, now seen corresponding path program 1 times [2018-11-23 01:58:52,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:52,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:52,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:58:52,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:58:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:58:52,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash 959532, now seen corresponding path program 1 times [2018-11-23 01:58:52,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:52,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:58:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] assume !(main_~bufsize~0 < 0);main_~len~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume !(main_~bufsize~0 < 0); [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume !(main_~bufsize~0 < 0); [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] COND FALSE !(main_~bufsize~0 < 0) [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] COND FALSE !(main_~bufsize~0 < 0) [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; [L12] havoc ~len~0; [L13] havoc ~i~0; [L14] havoc ~j~0; [L15] havoc ~bufsize~0; [L16] ~bufsize~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] COND FALSE !(~bufsize~0 < 0) [L18] ~len~0 := #t~nondet2; [L18] havoc #t~nondet2; [L19] ~limit~0 := ~bufsize~0 - 4; [L20] ~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] havoc ~len~0; [L13] havoc ~i~0; [L14] havoc ~j~0; [L15] havoc ~bufsize~0; [L16] ~bufsize~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] COND FALSE !(~bufsize~0 < 0) [L18] ~len~0 := #t~nondet2; [L18] havoc #t~nondet2; [L19] ~limit~0 := ~bufsize~0 - 4; [L20] ~i~0 := 0; [L12] int len; [L13] int i; [L14] int j; [L15] int bufsize; [L16] bufsize = __VERIFIER_nondet_int() [L17] COND FALSE !(bufsize < 0) [L18] len = __VERIFIER_nondet_int() [L19] int limit = bufsize - 4; [L20] i = 0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; [?] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); [L20-L51] assume !!(main_~i~0 < main_~len~0); [L21] main_~j~0 := 0; [L21-L50] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L20-L51] assume !!(main_~i~0 < main_~len~0); [L21] main_~j~0 := 0; [L21-L50] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); [L20-L51] COND FALSE !(!(main_~i~0 < main_~len~0)) [L21] main_~j~0 := 0; [L21-L50] COND TRUE !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L20-L51] COND FALSE !(!(main_~i~0 < main_~len~0)) [L21] main_~j~0 := 0; [L21-L50] COND TRUE !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0) [L20-L51] COND FALSE !(!(~i~0 < ~len~0)) [L21] ~j~0 := 0; [L21-L50] COND TRUE !(~i~0 < ~len~0 && ~j~0 < ~limit~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L20-L51] COND FALSE !(!(~i~0 < ~len~0)) [L21] ~j~0 := 0; [L21-L50] COND TRUE !(~i~0 < ~len~0 && ~j~0 < ~limit~0) [L20] COND TRUE i < len [L21] j = 0 [L21] COND FALSE !(i < len && j < limit) ----- [2018-11-23 01:58:52,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:58:52 BoogieIcfgContainer [2018-11-23 01:58:52,676 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 01:58:52,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:58:52,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:58:52,676 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:58:52,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:52" (3/4) ... [2018-11-23 01:58:52,679 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] assume !(main_~bufsize~0 < 0);main_~len~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume !(main_~bufsize~0 < 0); [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume !(main_~bufsize~0 < 0); [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] COND FALSE !(main_~bufsize~0 < 0) [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] COND FALSE !(main_~bufsize~0 < 0) [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; [L12] havoc ~len~0; [L13] havoc ~i~0; [L14] havoc ~j~0; [L15] havoc ~bufsize~0; [L16] ~bufsize~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] COND FALSE !(~bufsize~0 < 0) [L18] ~len~0 := #t~nondet2; [L18] havoc #t~nondet2; [L19] ~limit~0 := ~bufsize~0 - 4; [L20] ~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] havoc ~len~0; [L13] havoc ~i~0; [L14] havoc ~j~0; [L15] havoc ~bufsize~0; [L16] ~bufsize~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] COND FALSE !(~bufsize~0 < 0) [L18] ~len~0 := #t~nondet2; [L18] havoc #t~nondet2; [L19] ~limit~0 := ~bufsize~0 - 4; [L20] ~i~0 := 0; [L12] int len; [L13] int i; [L14] int j; [L15] int bufsize; [L16] bufsize = __VERIFIER_nondet_int() [L17] COND FALSE !(bufsize < 0) [L18] len = __VERIFIER_nondet_int() [L19] int limit = bufsize - 4; [L20] i = 0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; [?] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); [L20-L51] assume !!(main_~i~0 < main_~len~0); [L21] main_~j~0 := 0; [L21-L50] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L20-L51] assume !!(main_~i~0 < main_~len~0); [L21] main_~j~0 := 0; [L21-L50] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); [L20-L51] COND FALSE !(!(main_~i~0 < main_~len~0)) [L21] main_~j~0 := 0; [L21-L50] COND TRUE !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L20-L51] COND FALSE !(!(main_~i~0 < main_~len~0)) [L21] main_~j~0 := 0; [L21-L50] COND TRUE !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0) [L20-L51] COND FALSE !(!(~i~0 < ~len~0)) [L21] ~j~0 := 0; [L21-L50] COND TRUE !(~i~0 < ~len~0 && ~j~0 < ~limit~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L20-L51] COND FALSE !(!(~i~0 < ~len~0)) [L21] ~j~0 := 0; [L21-L50] COND TRUE !(~i~0 < ~len~0 && ~j~0 < ~limit~0) [L20] COND TRUE i < len [L21] j = 0 [L21] COND FALSE !(i < len && j < limit) ----- [2018-11-23 01:58:52,711 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c5898992-898e-465b-9216-27a943d3a78d/bin-2019/uautomizer/witness.graphml [2018-11-23 01:58:52,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:58:52,712 INFO L168 Benchmark]: Toolchain (without parser) took 862.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -112.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:58:52,713 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:58:52,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.18 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:58:52,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.09 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:58:52,714 INFO L168 Benchmark]: Boogie Preprocessor took 56.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:58:52,715 INFO L168 Benchmark]: RCFGBuilder took 215.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:58:52,715 INFO L168 Benchmark]: BuchiAutomizer took 350.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:58:52,716 INFO L168 Benchmark]: Witness Printer took 35.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:58:52,719 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.18 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 22.09 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 215.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 350.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Witness Printer took 35.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 2 locations. The remainder module has 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 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: 20]: 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 {bufsize=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@41083187=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5eabd967=0, i=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@61d3d2b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5bd1ec4d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@15709bef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@310d00c0=0, j=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c590911=0, len=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55ca80f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22d08e48=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3bc0399e=0, limit=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 20]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] assume !(main_~bufsize~0 < 0);main_~len~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume !(main_~bufsize~0 < 0); [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume !(main_~bufsize~0 < 0); [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] COND FALSE !(main_~bufsize~0 < 0) [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] COND FALSE !(main_~bufsize~0 < 0) [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; [L12] havoc ~len~0; [L13] havoc ~i~0; [L14] havoc ~j~0; [L15] havoc ~bufsize~0; [L16] ~bufsize~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] COND FALSE !(~bufsize~0 < 0) [L18] ~len~0 := #t~nondet2; [L18] havoc #t~nondet2; [L19] ~limit~0 := ~bufsize~0 - 4; [L20] ~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] havoc ~len~0; [L13] havoc ~i~0; [L14] havoc ~j~0; [L15] havoc ~bufsize~0; [L16] ~bufsize~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] COND FALSE !(~bufsize~0 < 0) [L18] ~len~0 := #t~nondet2; [L18] havoc #t~nondet2; [L19] ~limit~0 := ~bufsize~0 - 4; [L20] ~i~0 := 0; [L12] int len; [L13] int i; [L14] int j; [L15] int bufsize; [L16] bufsize = __VERIFIER_nondet_int() [L17] COND FALSE !(bufsize < 0) [L18] len = __VERIFIER_nondet_int() [L19] int limit = bufsize - 4; [L20] i = 0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; [?] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); [L20-L51] assume !!(main_~i~0 < main_~len~0); [L21] main_~j~0 := 0; [L21-L50] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L20-L51] assume !!(main_~i~0 < main_~len~0); [L21] main_~j~0 := 0; [L21-L50] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); [L20-L51] COND FALSE !(!(main_~i~0 < main_~len~0)) [L21] main_~j~0 := 0; [L21-L50] COND TRUE !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L20-L51] COND FALSE !(!(main_~i~0 < main_~len~0)) [L21] main_~j~0 := 0; [L21-L50] COND TRUE !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0) [L20-L51] COND FALSE !(!(~i~0 < ~len~0)) [L21] ~j~0 := 0; [L21-L50] COND TRUE !(~i~0 < ~len~0 && ~j~0 < ~limit~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L20-L51] COND FALSE !(!(~i~0 < ~len~0)) [L21] ~j~0 := 0; [L21-L50] COND TRUE !(~i~0 < ~len~0 && ~j~0 < ~limit~0) [L20] COND TRUE i < len [L21] j = 0 [L21] COND FALSE !(i < len && j < limit) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0;havoc main_~len~0;havoc main_~i~0;havoc main_~j~0;havoc main_~bufsize~0;main_~bufsize~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] assume !(main_~bufsize~0 < 0);main_~len~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~limit~0 := main_~bufsize~0 - 4;main_~i~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume !(main_~bufsize~0 < 0); [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume !(main_~bufsize~0 < 0); [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] COND FALSE !(main_~bufsize~0 < 0) [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_#t~post8, main_#t~post9, main_#t~post10, main_~len~0, main_~i~0, main_~j~0, main_~bufsize~0, main_~limit~0; [L12] havoc main_~len~0; [L13] havoc main_~i~0; [L14] havoc main_~j~0; [L15] havoc main_~bufsize~0; [L16] main_~bufsize~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] COND FALSE !(main_~bufsize~0 < 0) [L18] main_~len~0 := main_#t~nondet2; [L18] havoc main_#t~nondet2; [L19] main_~limit~0 := main_~bufsize~0 - 4; [L20] main_~i~0 := 0; [L12] havoc ~len~0; [L13] havoc ~i~0; [L14] havoc ~j~0; [L15] havoc ~bufsize~0; [L16] ~bufsize~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] COND FALSE !(~bufsize~0 < 0) [L18] ~len~0 := #t~nondet2; [L18] havoc #t~nondet2; [L19] ~limit~0 := ~bufsize~0 - 4; [L20] ~i~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] havoc ~len~0; [L13] havoc ~i~0; [L14] havoc ~j~0; [L15] havoc ~bufsize~0; [L16] ~bufsize~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] COND FALSE !(~bufsize~0 < 0) [L18] ~len~0 := #t~nondet2; [L18] havoc #t~nondet2; [L19] ~limit~0 := ~bufsize~0 - 4; [L20] ~i~0 := 0; [L12] int len; [L13] int i; [L14] int j; [L15] int bufsize; [L16] bufsize = __VERIFIER_nondet_int() [L17] COND FALSE !(bufsize < 0) [L18] len = __VERIFIER_nondet_int() [L19] int limit = bufsize - 4; [L20] i = 0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 < main_~len~0);main_~j~0 := 0; [?] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); [L20-L51] assume !!(main_~i~0 < main_~len~0); [L21] main_~j~0 := 0; [L21-L50] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L20-L51] assume !!(main_~i~0 < main_~len~0); [L21] main_~j~0 := 0; [L21-L50] assume !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0); [L20-L51] COND FALSE !(!(main_~i~0 < main_~len~0)) [L21] main_~j~0 := 0; [L21-L50] COND TRUE !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L20-L51] COND FALSE !(!(main_~i~0 < main_~len~0)) [L21] main_~j~0 := 0; [L21-L50] COND TRUE !(main_~i~0 < main_~len~0 && main_~j~0 < main_~limit~0) [L20-L51] COND FALSE !(!(~i~0 < ~len~0)) [L21] ~j~0 := 0; [L21-L50] COND TRUE !(~i~0 < ~len~0 && ~j~0 < ~limit~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L20-L51] COND FALSE !(!(~i~0 < ~len~0)) [L21] ~j~0 := 0; [L21-L50] COND TRUE !(~i~0 < ~len~0 && ~j~0 < ~limit~0) [L20] COND TRUE i < len [L21] j = 0 [L21] COND FALSE !(i < len && j < limit) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L12] int len; [L13] int i; [L14] int j; [L15] int bufsize; [L16] bufsize = __VERIFIER_nondet_int() [L17] COND FALSE !(bufsize < 0) [L18] len = __VERIFIER_nondet_int() [L19] int limit = bufsize - 4; [L20] i = 0 Loop: [L20] COND TRUE i < len [L21] j = 0 [L21] COND FALSE !(i < len && j < limit) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...