./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.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 6441f2629f7ca5357ff69069fc5c217332d52665 .................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:01:59,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:01:59,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:01:59,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:01:59,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:01:59,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:01:59,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:01:59,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:01:59,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:01:59,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:01:59,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:01:59,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:01:59,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:01:59,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:01:59,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:01:59,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:01:59,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:01:59,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:01:59,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:01:59,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:01:59,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:01:59,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:01:59,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:01:59,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:01:59,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:01:59,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:01:59,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:01:59,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:01:59,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:01:59,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:01:59,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:01:59,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:01:59,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:01:59,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:01:59,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:01:59,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:01:59,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:01:59,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:01:59,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:01:59,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:01:59,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:01:59,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:01:59,769 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:01:59,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:01:59,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:01:59,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:01:59,771 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:01:59,772 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:01:59,772 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:01:59,772 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:01:59,772 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:01:59,773 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:01:59,774 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:01:59,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:01:59,775 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:01:59,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:01:59,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:01:59,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:01:59,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:01:59,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:01:59,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:01:59,777 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:01:59,777 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:01:59,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:01:59,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:01:59,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:01:59,778 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:01:59,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:01:59,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:01:59,779 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:01:59,781 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:01:59,781 INFO L138 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 -> 6441f2629f7ca5357ff69069fc5c217332d52665 [2019-11-28 03:02:00,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:02:00,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:02:00,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:02:00,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:02:00,120 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:02:00,121 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2019-11-28 03:02:00,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea5d35cd/2b8c9a262f9d43b59a5309d026c7b66b/FLAGa8f995135 [2019-11-28 03:02:00,751 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:02:00,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2019-11-28 03:02:00,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea5d35cd/2b8c9a262f9d43b59a5309d026c7b66b/FLAGa8f995135 [2019-11-28 03:02:01,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea5d35cd/2b8c9a262f9d43b59a5309d026c7b66b [2019-11-28 03:02:01,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:02:01,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:02:01,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:02:01,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:02:01,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:02:01,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd431ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01, skipping insertion in model container [2019-11-28 03:02:01,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:02:01,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:02:01,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:02:01,529 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:02:01,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:02:01,641 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:02:01,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01 WrapperNode [2019-11-28 03:02:01,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:02:01,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:02:01,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:02:01,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:02:01,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:02:01,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:02:01,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:02:01,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:02:01,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... [2019-11-28 03:02:01,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:02:01,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:02:01,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:02:01,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:02:01,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:02:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:02:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:02:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:02:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:02:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:02:02,076 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:02:02,077 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 03:02:02,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:02 BoogieIcfgContainer [2019-11-28 03:02:02,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:02:02,080 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:02:02,080 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:02:02,085 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:02:02,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:02,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:02:01" (1/3) ... [2019-11-28 03:02:02,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34508ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:02:02, skipping insertion in model container [2019-11-28 03:02:02,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:02,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:01" (2/3) ... [2019-11-28 03:02:02,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34508ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:02:02, skipping insertion in model container [2019-11-28 03:02:02,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:02,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:02" (3/3) ... [2019-11-28 03:02:02,093 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2019-11-28 03:02:02,160 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:02:02,160 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:02:02,160 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:02:02,160 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:02:02,161 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:02:02,161 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:02:02,161 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:02:02,161 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:02:02,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 03:02:02,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:02:02,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:02,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:02,204 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:02:02,204 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:02:02,204 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:02:02,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 03:02:02,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:02:02,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:02,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:02,207 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:02:02,207 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:02:02,213 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 4#L552-4true [2019-11-28 03:02:02,214 INFO L796 eck$LassoCheckResult]: Loop: 4#L552-4true call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 9#L552-1true assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 13#L553-4true assume !true; 14#L552-3true call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5; 4#L552-4true [2019-11-28 03:02:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:02:02,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:02,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945853750] [2019-11-28 03:02:02,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:02,405 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:02,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:02,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2019-11-28 03:02:02,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:02,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497122094] [2019-11-28 03:02:02,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:02,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497122094] [2019-11-28 03:02:02,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:02:02,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:02:02,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762862196] [2019-11-28 03:02:02,454 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:02:02,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:02:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:02:02,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:02:02,475 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-28 03:02:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:02:02,486 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-28 03:02:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:02:02,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-28 03:02:02,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:02:02,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2019-11-28 03:02:02,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 03:02:02,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 03:02:02,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-11-28 03:02:02,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:02:02,496 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 03:02:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-11-28 03:02:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-28 03:02:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:02:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 03:02:02,528 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 03:02:02,528 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 03:02:02,528 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:02:02,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-11-28 03:02:02,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:02:02,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:02,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:02,530 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:02:02,530 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:02:02,530 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 32#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 33#L552-4 [2019-11-28 03:02:02,530 INFO L796 eck$LassoCheckResult]: Loop: 33#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 34#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 39#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 36#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 37#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5; 33#L552-4 [2019-11-28 03:02:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 03:02:02,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:02,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734626739] [2019-11-28 03:02:02,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:02,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:02,578 INFO L82 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2019-11-28 03:02:02,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:02,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870879904] [2019-11-28 03:02:02,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:02,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870879904] [2019-11-28 03:02:02,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:02:02,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:02:02,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675915832] [2019-11-28 03:02:02,659 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:02:02,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:02:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:02:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:02:02,660 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-28 03:02:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:02:02,724 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-28 03:02:02,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:02:02,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-28 03:02:02,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:02:02,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 03:02:02,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:02:02,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:02:02,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-28 03:02:02,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:02:02,728 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 03:02:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-28 03:02:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 03:02:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 03:02:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 03:02:02,730 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 03:02:02,730 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 03:02:02,731 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:02:02,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-28 03:02:02,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:02:02,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:02,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:02,733 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:02:02,733 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:02,733 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem10, main_#t~mem11, main_#t~mem8, main_#t~mem9, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem12, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(0, main_~c~0.base, main_~c~0.offset, 4);call write~int(0, main_~i~0.base, main_~i~0.offset, 4); 60#L552-4 [2019-11-28 03:02:02,734 INFO L796 eck$LassoCheckResult]: Loop: 60#L552-4 call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 61#L552-1 assume !!(main_#t~mem7 < 10);havoc main_#t~mem7;call write~int(3, main_~j~0.base, main_~j~0.offset, 4); 65#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 63#L553-1 assume !!(main_#t~mem9 < 12);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem11, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem11; 64#L553-3 call main_#t~mem8 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(2 + main_#t~mem8, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem8; 66#L553-4 call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); 68#L553-1 assume !(main_#t~mem9 < 12);havoc main_#t~mem9; 67#L552-3 call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5; 60#L552-4 [2019-11-28 03:02:02,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 03:02:02,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:02,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482312617] [2019-11-28 03:02:02,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:02,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:02,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2019-11-28 03:02:02,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:02,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784560932] [2019-11-28 03:02:02,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:02,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784560932] [2019-11-28 03:02:02,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056492364] [2019-11-28 03:02:02,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:02:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:03,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:02:03,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:03,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 03:02:03,090 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:02:03,095 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:03,096 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:02:03,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 03:02:03,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:02:03,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 124 [2019-11-28 03:02:03,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:02:03,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:02:03,248 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:890) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:809) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 03:02:03,253 INFO L168 Benchmark]: Toolchain (without parser) took 2216.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 961.7 MB in the beginning and 950.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:03,253 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:03,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -96.5 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:03,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:03,256 INFO L168 Benchmark]: Boogie Preprocessor took 24.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:03,257 INFO L168 Benchmark]: RCFGBuilder took 361.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:03,258 INFO L168 Benchmark]: BuchiAutomizer took 1170.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 950.2 MB in the end (delta: 75.9 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:03,267 INFO L335 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -96.5 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 361.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1170.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 950.2 MB in the end (delta: 75.9 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...