./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/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 64bit --witnessprinter.graph.data.programhash 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-09 10:42:45,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:42:45,427 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:42:45,433 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:42:45,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:42:45,434 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:42:45,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:42:45,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:42:45,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:42:45,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:42:45,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:42:45,437 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:42:45,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:42:45,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:42:45,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:42:45,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:42:45,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:42:45,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:42:45,442 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:42:45,443 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:42:45,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:42:45,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:42:45,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:42:45,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:42:45,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:42:45,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:42:45,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:42:45,447 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:42:45,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:42:45,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:42:45,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:42:45,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:42:45,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:42:45,449 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:42:45,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:42:45,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:42:45,450 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 10:42:45,458 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:42:45,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:42:45,458 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:42:45,458 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:42:45,459 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:42:45,459 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:42:45,459 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:42:45,459 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:42:45,459 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:42:45,459 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:42:45,459 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:42:45,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:42:45,460 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:42:45,461 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:42:45,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:42:45,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:42:45,461 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:42:45,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:42:45,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:42:45,461 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:42:45,462 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:42:45,462 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_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 [2018-12-09 10:42:45,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:42:45,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:42:45,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:42:45,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:42:45,488 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:42:45,489 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2018-12-09 10:42:45,522 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/data/d0eba6bbb/aa464cb459f84a84b7d9d8e7858c7505/FLAGea99978cf [2018-12-09 10:42:45,959 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:42:45,960 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2018-12-09 10:42:45,966 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/data/d0eba6bbb/aa464cb459f84a84b7d9d8e7858c7505/FLAGea99978cf [2018-12-09 10:42:45,975 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/data/d0eba6bbb/aa464cb459f84a84b7d9d8e7858c7505 [2018-12-09 10:42:45,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:42:45,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:42:45,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:42:45,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:42:45,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:42:45,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:42:45" (1/1) ... [2018-12-09 10:42:45,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6a5933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:45, skipping insertion in model container [2018-12-09 10:42:45,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:42:45" (1/1) ... [2018-12-09 10:42:45,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:42:46,006 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:42:46,143 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:42:46,149 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:42:46,214 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:42:46,243 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:42:46,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46 WrapperNode [2018-12-09 10:42:46,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:42:46,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:42:46,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:42:46,244 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:42:46,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:42:46,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:42:46,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:42:46,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:42:46,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... [2018-12-09 10:42:46,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:42:46,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:42:46,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:42:46,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:42:46,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/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-12-09 10:42:46,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:42:46,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 10:42:46,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:42:46,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:42:46,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:42:46,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:42:46,421 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:42:46,421 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 10:42:46,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:46 BoogieIcfgContainer [2018-12-09 10:42:46,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:42:46,422 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:42:46,422 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:42:46,424 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:42:46,425 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:42:46,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:42:45" (1/3) ... [2018-12-09 10:42:46,425 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c0cf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:42:46, skipping insertion in model container [2018-12-09 10:42:46,425 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:42:46,426 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:46" (2/3) ... [2018-12-09 10:42:46,426 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c0cf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:42:46, skipping insertion in model container [2018-12-09 10:42:46,426 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:42:46,426 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:46" (3/3) ... [2018-12-09 10:42:46,427 INFO L375 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca_false-termination.c.i [2018-12-09 10:42:46,457 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:42:46,457 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:42:46,457 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:42:46,457 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:42:46,458 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:42:46,458 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:42:46,458 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:42:46,458 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:42:46,458 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:42:46,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-09 10:42:46,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:42:46,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:46,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:46,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:42:46,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:42:46,484 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:42:46,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-09 10:42:46,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:42:46,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:46,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:46,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:42:46,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:42:46,490 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 14#L552-3true [2018-12-09 10:42:46,490 INFO L796 eck$LassoCheckResult]: Loop: 14#L552-3true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L551-1true assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 8#L552true assume !main_#t~short7; 12#L552-2true assume !main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 14#L552-3true [2018-12-09 10:42:46,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 10:42:46,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:46,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:46,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:46,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2018-12-09 10:42:46,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:46,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:46,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:46,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:46,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:46,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2018-12-09 10:42:46,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:46,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:46,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:46,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:46,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:46,732 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:42:46,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:42:46,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:42:46,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:42:46,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:42:46,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:42:46,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:42:46,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:42:46,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca_false-termination.c.i_Iteration1_Lasso [2018-12-09 10:42:46,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:42:46,734 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:42:46,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:42:46,949 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:42:46,952 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:42:46,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:46,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:46,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:46,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:46,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:46,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:46,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:46,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:42:46,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:42:46,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:42:46,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:42:46,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:42:46,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:42:46,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:42:46,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:42:46,994 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:42:47,002 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:42:47,002 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:42:47,003 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:42:47,004 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:42:47,005 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:42:47,005 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-12-09 10:42:47,010 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 10:42:47,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:42:47,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:47,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:42:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:47,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:42:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:47,092 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:42:47,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-12-09 10:42:47,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 10 states. [2018-12-09 10:42:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 10:42:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:42:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-09 10:42:47,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-09 10:42:47,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:47,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 10:42:47,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:47,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-09 10:42:47,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:42:47,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2018-12-09 10:42:47,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:42:47,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 35 transitions. [2018-12-09 10:42:47,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 10:42:47,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 10:42:47,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2018-12-09 10:42:47,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:42:47,169 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-12-09 10:42:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2018-12-09 10:42:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-12-09 10:42:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 10:42:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-09 10:42:47,186 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 10:42:47,186 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 10:42:47,187 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:42:47,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-12-09 10:42:47,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:42:47,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:47,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:47,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 10:42:47,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:42:47,188 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 117#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 129#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 130#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 125#L552-2 [2018-12-09 10:42:47,188 INFO L796 eck$LassoCheckResult]: Loop: 125#L552-2 assume !main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 128#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 133#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 124#L552 assume !main_#t~short7; 125#L552-2 [2018-12-09 10:42:47,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-12-09 10:42:47,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:47,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:47,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:47,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2018-12-09 10:42:47,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:47,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:47,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:47,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:47,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:42:47,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:42:47,243 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 10:42:47,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:42:47,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:42:47,245 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-09 10:42:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:42:47,266 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-12-09 10:42:47,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:42:47,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-12-09 10:42:47,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:42:47,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2018-12-09 10:42:47,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 10:42:47,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 10:42:47,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-12-09 10:42:47,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:42:47,268 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-09 10:42:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-12-09 10:42:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 10:42:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 10:42:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-12-09 10:42:47,269 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-09 10:42:47,269 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-12-09 10:42:47,269 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:42:47,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-12-09 10:42:47,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:42:47,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:47,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:47,270 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 10:42:47,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:42:47,270 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 171#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 184#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 178#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 180#L552-2 [2018-12-09 10:42:47,271 INFO L796 eck$LassoCheckResult]: Loop: 180#L552-2 assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 187#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 183#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 186#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 189#L552 assume !main_#t~short7; 180#L552-2 [2018-12-09 10:42:47,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:47,271 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2018-12-09 10:42:47,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:47,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:47,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:42:47,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2018-12-09 10:42:47,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:47,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:47,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:42:47,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:42:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:42:47,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:42:47,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:42:47,298 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 10:42:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:42:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:42:47,298 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-09 10:42:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:42:47,331 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2018-12-09 10:42:47,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:42:47,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-12-09 10:42:47,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-09 10:42:47,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2018-12-09 10:42:47,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 10:42:47,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 10:42:47,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-12-09 10:42:47,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:42:47,334 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-09 10:42:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-12-09 10:42:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-12-09 10:42:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 10:42:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-09 10:42:47,336 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 10:42:47,336 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 10:42:47,336 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:42:47,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-09 10:42:47,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-09 10:42:47,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:42:47,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:42:47,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 10:42:47,337 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:42:47,338 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 230#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 231#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 247#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 249#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2018-12-09 10:42:47,338 INFO L796 eck$LassoCheckResult]: Loop: 239#L552-2 assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 252#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 235#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 244#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 238#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2018-12-09 10:42:47,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2018-12-09 10:42:47,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:47,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:47,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2018-12-09 10:42:47,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:47,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:42:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:42:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2018-12-09 10:42:47,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:42:47,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:42:47,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:42:47,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:42:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:42:47,646 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-09 10:42:47,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 10:42:47 BoogieIcfgContainer [2018-12-09 10:42:47,661 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 10:42:47,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:42:47,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:42:47,661 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:42:47,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:46" (3/4) ... [2018-12-09 10:42:47,663 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 10:42:47,687 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f9d2eb6a-bdd8-4c46-9b55-273a30e39aee/bin-2019/uautomizer/witness.graphml [2018-12-09 10:42:47,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:42:47,688 INFO L168 Benchmark]: Toolchain (without parser) took 1710.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.7 MB in the beginning and 854.5 MB in the end (delta: 97.2 MB). Peak memory consumption was 236.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:47,688 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:42:47,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:47,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.23 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:47,689 INFO L168 Benchmark]: Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:42:47,689 INFO L168 Benchmark]: RCFGBuilder took 141.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:47,690 INFO L168 Benchmark]: BuchiAutomizer took 1238.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 858.0 MB in the end (delta: 246.7 MB). Peak memory consumption was 246.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:47,690 INFO L168 Benchmark]: Witness Printer took 26.52 ms. Allocated memory is still 1.2 GB. Free memory was 858.0 MB in the beginning and 854.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:42:47,692 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.23 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 141.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1238.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 858.0 MB in the end (delta: 246.7 MB). Peak memory consumption was 246.7 MB. Max. memory is 11.5 GB. * Witness Printer took 26.52 ms. Allocated memory is still 1.2 GB. Free memory was 858.0 MB in the beginning and 854.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 16 SDslu, 27 SDs, 0 SdLazy, 75 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital97 mio100 ax118 hnf100 lsp76 ukn71 mio100 lsp42 div100 bol100 ite100 ukn100 eq144 hnf92 smp83 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: 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: 552]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d852818=3, NULL=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d78b5ee=0, NULL=0, x=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d852818=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5adc72ec=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3e6d72c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@527ee9da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4373d86=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@21f700df=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@501a7bc6=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@e48bd1c=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 552]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...