./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.24-91b1670 [2018-11-28 23:18:22,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:22,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:22,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:22,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:22,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:22,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:22,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:22,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:22,847 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:22,850 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:22,851 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:22,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:22,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:22,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:22,864 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:22,865 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:22,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:22,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:22,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:22,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:22,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:22,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:22,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:22,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:22,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:22,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:22,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:22,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:22,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:22,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:22,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:22,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:22,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:22,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:22,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:22,885 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:22,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:22,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:22,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:22,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:22,912 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:22,913 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:22,913 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:22,913 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:22,913 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:22,913 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:22,914 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:22,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:22,914 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:22,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:22,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:22,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:22,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:22,916 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:22,916 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:22,916 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:22,916 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:22,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:22,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:22,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:22,917 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:22,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:22,917 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:22,918 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:22,919 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:22,919 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 [2018-11-28 23:18:22,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:22,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:22,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:22,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:22,989 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:22,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2018-11-28 23:18:23,051 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c64710f/b8155ab2e9d642438c14e89d10afa509/FLAG85d56a0ad [2018-11-28 23:18:23,620 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:23,622 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2018-11-28 23:18:23,641 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c64710f/b8155ab2e9d642438c14e89d10afa509/FLAG85d56a0ad [2018-11-28 23:18:23,840 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c64710f/b8155ab2e9d642438c14e89d10afa509 [2018-11-28 23:18:23,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:23,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:23,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:23,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:23,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:23,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:23" (1/1) ... [2018-11-28 23:18:23,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15085b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:23, skipping insertion in model container [2018-11-28 23:18:23,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:23" (1/1) ... [2018-11-28 23:18:23,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:23,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:24,248 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:24,264 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:24,338 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:24,398 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:24,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24 WrapperNode [2018-11-28 23:18:24,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:24,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:24,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:24,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:24,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:24,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:24,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:24,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:24,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... [2018-11-28 23:18:24,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:24,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:24,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:24,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:24,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:24,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:24,988 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:24,988 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:18:24,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:24 BoogieIcfgContainer [2018-11-28 23:18:24,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:24,990 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:24,990 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:24,994 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:24,995 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:24,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:23" (1/3) ... [2018-11-28 23:18:24,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aae467a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:24, skipping insertion in model container [2018-11-28 23:18:24,997 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:24,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:24" (2/3) ... [2018-11-28 23:18:24,998 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aae467a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:24, skipping insertion in model container [2018-11-28 23:18:25,000 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:25,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:24" (3/3) ... [2018-11-28 23:18:25,003 INFO L375 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca_false-termination.c.i [2018-11-28 23:18:25,067 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:25,068 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:25,068 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:25,068 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:25,068 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:25,068 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:25,069 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:25,069 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:25,069 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:25,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:18:25,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:25,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:25,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:25,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:18:25,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:25,123 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:25,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:18:25,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:25,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:25,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:25,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:18:25,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:25,136 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-11-28 23:18:25,137 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~short7;havoc main_#t~mem5;havoc main_#t~mem6;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 14#L552-3true [2018-11-28 23:18:25,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:18:25,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:25,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:25,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:25,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:25,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:25,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2018-11-28 23:18:25,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:25,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:25,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:25,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:25,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:25,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2018-11-28 23:18:25,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:25,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:25,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:25,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:25,846 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-28 23:18:26,270 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:18:26,379 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:26,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:26,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:26,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:26,381 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:26,381 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:26,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:26,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:26,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-28 23:18:26,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:26,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:26,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,669 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-28 23:18:26,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:26,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:27,182 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-28 23:18:27,555 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:27,561 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:27,563 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-11-28 23:18:27,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:27,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:27,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:27,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:27,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:27,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:27,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:27,600 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-11-28 23:18:27,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:27,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:27,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:27,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:27,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:27,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:27,640 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:27,654 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:27,654 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:27,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:27,659 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:27,660 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:27,660 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-11-28 23:18:27,682 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:18:27,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:27,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:27,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:27,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:27,886 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-28 23:18:27,901 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-11-28 23:18:27,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-11-28 23:18:28,083 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-11-28 23:18:28,087 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-11-28 23:18:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:18:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 23:18:28,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:18:28,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:28,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:18:28,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:28,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 23:18:28,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:28,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2018-11-28 23:18:28,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:28,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 35 transitions. [2018-11-28 23:18:28,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:18:28,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:18:28,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2018-11-28 23:18:28,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:28,109 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-28 23:18:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2018-11-28 23:18:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-28 23:18:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:18:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-28 23:18:28,142 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 23:18:28,142 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 23:18:28,142 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:28,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-28 23:18:28,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:28,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:28,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:28,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:18:28,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:28,145 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-11-28 23:18:28,145 INFO L796 eck$LassoCheckResult]: Loop: 125#L552-2 assume !main_#t~short7;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;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-11-28 23:18:28,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,145 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-11-28 23:18:28,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:28,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:28,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2018-11-28 23:18:28,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:28,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:28,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:28,270 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-28 23:18:28,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:28,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:18:28,276 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:18:28,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:18:28,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:18:28,281 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:18:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:28,371 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-11-28 23:18:28,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:18:28,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-11-28 23:18:28,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:28,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2018-11-28 23:18:28,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:18:28,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:18:28,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-28 23:18:28,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:28,377 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-28 23:18:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-28 23:18:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 23:18:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:18:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-28 23:18:28,380 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-28 23:18:28,380 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-28 23:18:28,380 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:28,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-28 23:18:28,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:28,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:28,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:28,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:18:28,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:18:28,383 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-11-28 23:18:28,383 INFO L796 eck$LassoCheckResult]: Loop: 180#L552-2 assume main_#t~short7;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;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-11-28 23:18:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2018-11-28 23:18:28,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2018-11-28 23:18:28,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:28,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:28,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:28,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:28,528 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-28 23:18:28,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:28,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:18:28,529 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:18:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:18:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:18:28,530 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 23:18:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:28,650 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2018-11-28 23:18:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:18:28,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-11-28 23:18:28,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:18:28,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2018-11-28 23:18:28,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 23:18:28,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 23:18:28,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-11-28 23:18:28,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:28,656 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-28 23:18:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-11-28 23:18:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-11-28 23:18:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:18:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-28 23:18:28,659 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 23:18:28,660 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 23:18:28,660 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:28,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-28 23:18:28,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:18:28,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:28,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:28,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:18:28,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:18:28,664 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-11-28 23:18:28,664 INFO L796 eck$LassoCheckResult]: Loop: 239#L552-2 assume main_#t~short7;havoc main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;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-11-28 23:18:28,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2018-11-28 23:18:28,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:28,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2018-11-28 23:18:28,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:28,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:28,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2018-11-28 23:18:28,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:28,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,850 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2018-11-28 23:18:29,111 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-11-28 23:18:29,433 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-11-28 23:18:29,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:29 BoogieIcfgContainer [2018-11-28 23:18:29,469 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:29,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:29,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:29,470 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:29,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:24" (3/4) ... [2018-11-28 23:18:29,475 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:18:29,526 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:18:29,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:29,527 INFO L168 Benchmark]: Toolchain (without parser) took 5682.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.4 MB in the beginning and 868.6 MB in the end (delta: 82.7 MB). Peak memory consumption was 213.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,529 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:29,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.18 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.87 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,532 INFO L168 Benchmark]: Boogie Preprocessor took 31.56 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-11-28 23:18:29,533 INFO L168 Benchmark]: RCFGBuilder took 431.60 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,535 INFO L168 Benchmark]: BuchiAutomizer took 4478.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.6 MB in the end (delta: 229.7 MB). Peak memory consumption was 229.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:29,535 INFO L168 Benchmark]: Witness Printer took 56.81 ms. Allocated memory is still 1.2 GB. Free memory is still 868.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:29,542 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 553.18 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.87 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.56 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 431.60 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4478.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.6 MB in the end (delta: 229.7 MB). Peak memory consumption was 229.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.81 ms. Allocated memory is still 1.2 GB. Free memory is still 868.6 MB. There was no memory consumed. 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 4.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. 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.2s 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: 37ms 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@61169091=3, NULL=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b0670f9=0, NULL=0, x=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61169091=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@44126ebf=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5354f3c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6758891c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2f93f5be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6ca5f470=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2b6507bb=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4a1970ad=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...