./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cebb5f481285aa400c004636e713993debded4b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:59:04,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:59:04,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:59:04,737 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:59:04,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:59:04,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:59:04,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:59:04,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:59:04,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:59:04,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:59:04,747 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:59:04,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:59:04,748 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:59:04,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:59:04,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:59:04,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:59:04,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:59:04,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:59:04,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:59:04,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:59:04,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:59:04,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:59:04,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:59:04,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:59:04,765 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:59:04,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:59:04,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:59:04,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:59:04,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:59:04,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:59:04,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:59:04,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:59:04,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:59:04,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:59:04,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:59:04,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:59:04,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:59:04,795 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:59:04,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:59:04,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:59:04,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:59:04,797 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:59:04,797 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:59:04,797 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:59:04,797 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:59:04,797 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:59:04,797 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:59:04,798 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:59:04,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:59:04,798 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:59:04,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:59:04,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:59:04,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:59:04,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:59:04,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:59:04,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:59:04,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:59:04,799 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:59:04,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:59:04,800 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:59:04,800 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:59:04,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:59:04,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:59:04,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:59:04,801 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:59:04,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:59:04,801 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:59:04,801 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:59:04,802 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:59:04,802 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cebb5f481285aa400c004636e713993debded4b [2019-01-14 04:59:04,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:59:04,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:59:04,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:59:04,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:59:04,867 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:59:04,868 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2019-01-14 04:59:04,930 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df1ac333/ba38044779c44ef2b730664a53320f93/FLAG01cf6ecd4 [2019-01-14 04:59:05,485 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:59:05,486 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2019-01-14 04:59:05,505 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df1ac333/ba38044779c44ef2b730664a53320f93/FLAG01cf6ecd4 [2019-01-14 04:59:05,715 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df1ac333/ba38044779c44ef2b730664a53320f93 [2019-01-14 04:59:05,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:59:05,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:59:05,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:59:05,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:59:05,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:59:05,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:05" (1/1) ... [2019-01-14 04:59:05,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729836ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:05, skipping insertion in model container [2019-01-14 04:59:05,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:05" (1/1) ... [2019-01-14 04:59:05,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:59:05,801 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:59:06,152 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:59:06,171 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:59:06,213 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:59:06,380 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:59:06,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06 WrapperNode [2019-01-14 04:59:06,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:59:06,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:59:06,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:59:06,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:59:06,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:59:06,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:59:06,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:59:06,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:59:06,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... [2019-01-14 04:59:06,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:59:06,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:59:06,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:59:06,489 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:59:06,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:59:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-14 04:59:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-14 04:59:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-14 04:59:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-14 04:59:06,556 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-14 04:59:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 04:59:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:59:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 04:59:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:59:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 04:59:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:59:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-14 04:59:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:59:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:59:06,879 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 04:59:06,949 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:59:06,949 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 04:59:06,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:06 BoogieIcfgContainer [2019-01-14 04:59:06,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:59:06,951 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:59:06,951 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:59:06,954 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:59:06,955 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:06,955 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:59:05" (1/3) ... [2019-01-14 04:59:06,956 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37bbb476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:59:06, skipping insertion in model container [2019-01-14 04:59:06,957 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:06,957 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:06" (2/3) ... [2019-01-14 04:59:06,957 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37bbb476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:59:06, skipping insertion in model container [2019-01-14 04:59:06,957 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:06,957 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:06" (3/3) ... [2019-01-14 04:59:06,959 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2019-01-14 04:59:07,019 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:59:07,020 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:59:07,020 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:59:07,020 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:59:07,020 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:59:07,020 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:59:07,021 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:59:07,021 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:59:07,021 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:59:07,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 04:59:07,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 04:59:07,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:07,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:07,069 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:07,069 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 04:59:07,069 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:59:07,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 04:59:07,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 04:59:07,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:07,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:07,072 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:07,072 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 04:59:07,079 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 9#L-1true havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 11#L744true call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 13##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 4#$Ultimate##0true #t~loopctr5 := 0; 7#L-1-1true [2019-01-14 04:59:07,080 INFO L796 eck$LassoCheckResult]: Loop: 7#L-1-1true assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 7#L-1-1true [2019-01-14 04:59:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash 28715065, now seen corresponding path program 1 times [2019-01-14 04:59:07,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:07,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:07,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2019-01-14 04:59:07,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:07,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:07,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:07,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:07,273 INFO L82 PathProgramCache]: Analyzing trace with hash 890167032, now seen corresponding path program 1 times [2019-01-14 04:59:07,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:07,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:07,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:07,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:07,483 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 04:59:08,033 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-14 04:59:08,337 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 04:59:08,616 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:59:08,746 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:59:09,378 WARN L181 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-01-14 04:59:09,625 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-14 04:59:09,639 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:59:09,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:59:09,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:59:09,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:59:09,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:59:09,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:59:09,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:59:09,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:59:09,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-14 04:59:09,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:59:09,642 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:59:09,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:09,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:09,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:09,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:09,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,357 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-01-14 04:59:10,651 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-14 04:59:10,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:10,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:11,379 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-01-14 04:59:11,475 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:59:11,481 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:59:11,483 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 [2019-01-14 04:59:11,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:11,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:11,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:11,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,494 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 [2019-01-14 04:59:11,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:11,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:11,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:11,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,501 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 [2019-01-14 04:59:11,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:11,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:11,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:11,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,505 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 [2019-01-14 04:59:11,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,519 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 [2019-01-14 04:59:11,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,536 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 [2019-01-14 04:59:11,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,575 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 [2019-01-14 04:59:11,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,595 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 [2019-01-14 04:59:11,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,620 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 [2019-01-14 04:59:11,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,638 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 [2019-01-14 04:59:11,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,663 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 [2019-01-14 04:59:11,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:11,677 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 [2019-01-14 04:59:11,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:11,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:11,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:11,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:11,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:11,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:11,707 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:59:11,736 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:59:11,737 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:59:11,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:59:11,744 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:59:11,744 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:59:11,745 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr5, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr5 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-01-14 04:59:11,867 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-01-14 04:59:11,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-14 04:59:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:11,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:11,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:11,969 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 04:59:11,971 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 2 states. [2019-01-14 04:59:12,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 2 states. Result 27 states and 34 transitions. Complement of second has 6 states. [2019-01-14 04:59:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:59:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 04:59:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 04:59:12,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 04:59:12,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:12,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 04:59:12,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:12,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 04:59:12,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:12,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-01-14 04:59:12,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:12,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 23 transitions. [2019-01-14 04:59:12,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:59:12,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:59:12,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-01-14 04:59:12,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:12,070 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-14 04:59:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-01-14 04:59:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-14 04:59:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:59:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-14 04:59:12,094 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 04:59:12,094 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 04:59:12,094 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:59:12,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-01-14 04:59:12,095 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:12,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:12,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:12,096 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:59:12,096 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 04:59:12,097 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 133#L-1 havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 134#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 142##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 149#$Ultimate##0 #t~loopctr5 := 0; 148#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 147#L-1-3 [2019-01-14 04:59:12,097 INFO L796 eck$LassoCheckResult]: Loop: 147#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 147#L-1-3 [2019-01-14 04:59:12,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,097 INFO L82 PathProgramCache]: Analyzing trace with hash 890167034, now seen corresponding path program 1 times [2019-01-14 04:59:12,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:12,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:12,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:59:12,211 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:59:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,212 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2019-01-14 04:59:12,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:12,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,359 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 04:59:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:59:12,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:59:12,415 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 04:59:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:12,456 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-14 04:59:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:59:12,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-01-14 04:59:12,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:12,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-01-14 04:59:12,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:59:12,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:59:12,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-14 04:59:12,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:12,461 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 04:59:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-14 04:59:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 04:59:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 04:59:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-01-14 04:59:12,464 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 04:59:12,464 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 04:59:12,464 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:59:12,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-01-14 04:59:12,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:12,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:12,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:12,466 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:12,466 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 04:59:12,466 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 175#L-1 havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 176#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 185##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 192#$Ultimate##0 #t~loopctr5 := 0; 191#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 189#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 190#L-1-3 [2019-01-14 04:59:12,466 INFO L796 eck$LassoCheckResult]: Loop: 190#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 190#L-1-3 [2019-01-14 04:59:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1825374235, now seen corresponding path program 1 times [2019-01-14 04:59:12,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:12,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:12,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:59:12,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:59:12,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:12,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:12,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:59:12,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-14 04:59:12,667 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:59:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2019-01-14 04:59:12,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:12,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:12,807 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 04:59:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 04:59:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-14 04:59:12,830 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 7 Second operand 8 states. [2019-01-14 04:59:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:12,939 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-14 04:59:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:59:12,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-01-14 04:59:12,941 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:12,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-01-14 04:59:12,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 04:59:12,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 04:59:12,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-14 04:59:12,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:12,943 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 04:59:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-14 04:59:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 04:59:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 04:59:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-14 04:59:12,946 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 04:59:12,946 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 04:59:12,946 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:59:12,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-01-14 04:59:12,947 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:12,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:12,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:12,948 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:12,948 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 04:59:12,948 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 242#L-1 havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 243#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 251##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 246#$Ultimate##0 #t~loopctr5 := 0; 247#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 255#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 256#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 257#L-1-3 [2019-01-14 04:59:12,948 INFO L796 eck$LassoCheckResult]: Loop: 257#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 257#L-1-3 [2019-01-14 04:59:12,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:12,948 INFO L82 PathProgramCache]: Analyzing trace with hash 752026394, now seen corresponding path program 2 times [2019-01-14 04:59:12,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:12,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:12,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:12,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:13,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:59:13,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:59:13,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:59:13,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:59:13,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:59:13,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:13,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:59:13,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-01-14 04:59:13,329 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:59:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 3 times [2019-01-14 04:59:13,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:13,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:13,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:59:13,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:59:13,397 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 10 states. [2019-01-14 04:59:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:13,449 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-14 04:59:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:59:13,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-01-14 04:59:13,451 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:13,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-01-14 04:59:13,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 04:59:13,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 04:59:13,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-01-14 04:59:13,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:13,453 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 04:59:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-01-14 04:59:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-14 04:59:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 04:59:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-01-14 04:59:13,456 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 04:59:13,456 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 04:59:13,456 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:59:13,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-01-14 04:59:13,457 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:13,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:13,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:13,458 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:13,458 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 04:59:13,458 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 318#L-1 havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 319#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 327##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 339#$Ultimate##0 #t~loopctr5 := 0; 337#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 332#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 333#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 335#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 334#L-1-3 [2019-01-14 04:59:13,458 INFO L796 eck$LassoCheckResult]: Loop: 334#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 334#L-1-3 [2019-01-14 04:59:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1837981691, now seen corresponding path program 3 times [2019-01-14 04:59:13,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:13,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:13,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:13,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:59:13,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:59:13,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:59:13,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 04:59:13,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:59:13,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:13,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:59:13,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-01-14 04:59:13,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:59:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 4 times [2019-01-14 04:59:13,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:13,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 04:59:13,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-01-14 04:59:13,794 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 12 states. [2019-01-14 04:59:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:13,854 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-14 04:59:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:59:13,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2019-01-14 04:59:13,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:13,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2019-01-14 04:59:13,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:59:13,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:59:13,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-01-14 04:59:13,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:13,862 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 04:59:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-01-14 04:59:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-14 04:59:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 04:59:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-14 04:59:13,865 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 04:59:13,866 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 04:59:13,866 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:59:13,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-01-14 04:59:13,866 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2019-01-14 04:59:13,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:13,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:13,867 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:13,867 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 04:59:13,867 INFO L794 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 1 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 2 + ~#a~0.offset, 1);call write~init~int(0, ~#a~0.base, 3 + ~#a~0.offset, 1); 403#L-1 havoc main_#res;havoc main_#t~memcpy~res2.base, main_#t~memcpy~res2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset, foo_~#p~0.base, foo_~#p~0.offset;call foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.allocOnStack(4);call foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.allocOnHeap(10);call write~init~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); 404#L744 call foo_#t~memcpy~res1.base, foo_#t~memcpy~res1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 413##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 424#$Ultimate##0 #t~loopctr5 := 0; 422#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 417#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 418#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 421#L-1-1 assume #t~loopctr5 < size;call #t~mem6 := read~unchecked~int(src.base, src.offset + #t~loopctr5, 1);call write~unchecked~int(#t~mem6, dest.base, dest.offset + #t~loopctr5, 1);#t~loopctr5 := 1 + #t~loopctr5; 420#L-1-1 assume !(#t~loopctr5 < size);#t~loopctr7 := 0; 419#L-1-3 [2019-01-14 04:59:13,868 INFO L796 eck$LassoCheckResult]: Loop: 419#L-1-3 assume #t~loopctr7 < size;call #t~mem8.base, #t~mem8.offset := read~unchecked~$Pointer$(src.base, src.offset + #t~loopctr7, 4);call write~unchecked~$Pointer$(#t~mem8.base, #t~mem8.offset, dest.base, dest.offset + #t~loopctr7, 4);#t~loopctr7 := 4 + #t~loopctr7; 419#L-1-3 [2019-01-14 04:59:13,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1142857530, now seen corresponding path program 4 times [2019-01-14 04:59:13,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:13,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 5 times [2019-01-14 04:59:13,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:13,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1068845085, now seen corresponding path program 1 times [2019-01-14 04:59:13,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:13,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:13,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:14,936 WARN L181 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2019-01-14 04:59:14,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:14,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:15,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:15,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:15,466 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:15,482 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:15,674 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:15,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:15,872 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:15,881 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:16,005 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:16,011 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:16,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-14 04:59:16,102 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:367, output treesize:287 [2019-01-14 04:59:16,309 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-14 04:59:16,445 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 04:59:16,563 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-14 04:59:17,237 WARN L181 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 146 [2019-01-14 04:59:17,487 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-14 04:59:17,490 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:59:17,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:59:17,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:59:17,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:59:17,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:59:17,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:59:17,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:59:17,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:59:17,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2019-01-14 04:59:17,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:59:17,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:59:17,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:17,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:18,168 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) 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:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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-01-14 04:59:18,171 INFO L168 Benchmark]: Toolchain (without parser) took 12450.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -216.8 MB). Peak memory consumption was 350.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,172 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:59:18,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.52 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,177 INFO L168 Benchmark]: Boogie Preprocessor took 40.34 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. [2019-01-14 04:59:18,177 INFO L168 Benchmark]: RCFGBuilder took 465.09 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,178 INFO L168 Benchmark]: BuchiAutomizer took 11219.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.1 MB). Peak memory consumption was 370.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:18,185 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.17 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 659.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.52 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.34 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 465.09 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11219.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.1 MB). Peak memory consumption was 370.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...