./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cebb5f481285aa400c004636e713993debded4b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/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.23-1dbac8b [2018-11-10 04:44:52,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:44:52,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:44:52,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:44:52,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:44:52,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:44:52,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:44:52,984 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:44:52,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:44:52,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:44:52,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:44:52,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:44:52,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:44:52,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:44:52,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:44:52,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:44:52,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:44:52,991 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:44:52,992 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:44:52,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:44:52,994 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:44:52,995 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:44:52,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:44:52,997 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:44:52,997 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:44:52,998 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:44:52,999 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:44:53,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:44:53,000 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:44:53,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:44:53,001 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:44:53,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:44:53,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:44:53,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:44:53,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:44:53,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:44:53,003 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:44:53,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:44:53,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:44:53,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:44:53,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:44:53,015 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:44:53,015 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:44:53,015 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:44:53,015 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:44:53,015 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:44:53,016 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:44:53,016 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:44:53,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:44:53,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:44:53,016 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:44:53,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:44:53,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:44:53,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:44:53,017 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:44:53,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:44:53,017 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:44:53,017 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:44:53,017 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:44:53,017 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:44:53,017 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:44:53,018 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:44:53,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:44:53,018 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:44:53,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:44:53,018 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:44:53,018 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:44:53,019 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:44:53,019 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cebb5f481285aa400c004636e713993debded4b [2018-11-10 04:44:53,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:44:53,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:44:53,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:44:53,051 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:44:53,051 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:44:53,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-10 04:44:53,087 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/data/4d9b48244/7510b79e28824d09af68d2e5370fadb3/FLAG280085176 [2018-11-10 04:44:53,434 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:44:53,434 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/sv-benchmarks/c/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-10 04:44:53,445 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/data/4d9b48244/7510b79e28824d09af68d2e5370fadb3/FLAG280085176 [2018-11-10 04:44:53,455 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/data/4d9b48244/7510b79e28824d09af68d2e5370fadb3 [2018-11-10 04:44:53,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:44:53,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:44:53,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:44:53,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:44:53,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:44:53,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8e72be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53, skipping insertion in model container [2018-11-10 04:44:53,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:44:53,497 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:44:53,691 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:44:53,698 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:44:53,722 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:44:53,757 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:44:53,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53 WrapperNode [2018-11-10 04:44:53,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:44:53,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:44:53,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:44:53,758 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:44:53,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:44:53,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:44:53,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:44:53,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:44:53,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... [2018-11-10 04:44:53,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:44:53,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:44:53,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:44:53,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:44:53,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:44:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-10 04:44:53,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-10 04:44:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 04:44:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 04:44:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:44:53,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:44:54,059 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 04:44:54,074 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:44:54,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:44:54 BoogieIcfgContainer [2018-11-10 04:44:54,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:44:54,075 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:44:54,075 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:44:54,078 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:44:54,079 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:44:54,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:44:53" (1/3) ... [2018-11-10 04:44:54,080 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1017e476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:44:54, skipping insertion in model container [2018-11-10 04:44:54,080 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:44:54,080 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:44:53" (2/3) ... [2018-11-10 04:44:54,081 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1017e476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:44:54, skipping insertion in model container [2018-11-10 04:44:54,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:44:54,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:44:54" (3/3) ... [2018-11-10 04:44:54,082 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-11-10 04:44:54,117 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:44:54,117 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:44:54,118 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:44:54,118 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:44:54,118 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:44:54,118 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:44:54,118 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:44:54,118 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:44:54,118 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:44:54,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 04:44:54,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:54,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:44:54,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:44:54,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:44:54,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 04:44:54,155 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:44:54,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 04:44:54,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:54,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:44:54,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:44:54,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:44:54,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 04:44:54,162 INFO L793 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#a~0.base, ~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 0, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 1, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 2, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 3, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy2.base, main_#t~memcpy2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy1.base, foo_#t~memcpy1.offset, foo_~#p~0.base, foo_~#p~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 14#L743true SUMMARY for call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); srcloc: L743 17#L743-1true call foo_#t~memcpy1.base, foo_#t~memcpy1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 13##Ultimate.C_memcpyENTRYtrue assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 5#$Ultimate##0true #t~loopctr5 := 0; 8#L-1-1true [2018-11-10 04:44:54,162 INFO L795 eck$LassoCheckResult]: Loop: 8#L-1-1true assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 8#L-1-1true [2018-11-10 04:44:54,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:54,167 INFO L82 PathProgramCache]: Analyzing trace with hash 889463641, now seen corresponding path program 1 times [2018-11-10 04:44:54,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:54,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:44:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:54,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2018-11-10 04:44:54,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:54,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:54,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:44:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:54,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1803569115, now seen corresponding path program 1 times [2018-11-10 04:44:54,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:54,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:54,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:54,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:44:54,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:54,873 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 128 [2018-11-10 04:44:55,032 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-10 04:44:55,421 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 128 [2018-11-10 04:44:55,522 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:44:55,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:44:55,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:44:55,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:44:55,523 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:44:55,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:44:55,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:44:55,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:44:55,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 04:44:55,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:44:55,524 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:44:55,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:44:55,949 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:44:55,953 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:44:55,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:44:55,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:44:55,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:44:55,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:44:55,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:44:55,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:44:55,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:44:55,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:44:55,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:44:55,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:44:55,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:44:55,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:44:55,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:44:55,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:44:55,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:44:55,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:44:55,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:44:55,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:44:55,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:44:55,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:55,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:44:55,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:44:55,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:44:55,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:44:55,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:44:55,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:55,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:55,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:55,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:55,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:55,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:44:55,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:55,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:55,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:55,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:56,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:56,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:56,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:56,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:44:56,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:56,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:56,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:56,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:56,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:56,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:56,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:56,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:44:56,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:56,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:56,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:56,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:56,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:56,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:56,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:56,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:44:56,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:56,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:56,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:56,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:56,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:56,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:56,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:56,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:44:56,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:56,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:56,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:56,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:56,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:56,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:56,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:56,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:44:56,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:56,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:44:56,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:44:56,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:44:56,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:44:56,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:44:56,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:44:56,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:44:56,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:44:56,059 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:44:56,074 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 04:44:56,074 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 04:44:56,075 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:44:56,076 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:44:56,077 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:44:56,077 INFO L519 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 [] [2018-11-10 04:44:56,091 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 04:44:56,096 WARN L1239 BoogieBacktranslator]: unknown boogie variable size [2018-11-10 04:44:56,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:44:56,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:44:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:44:56,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:44:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:44:56,152 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 [2018-11-10 04:44:56,153 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 2 states. [2018-11-10 04:44:56,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 2 states. Result 26 states and 29 transitions. Complement of second has 6 states. [2018-11-10 04:44:56,195 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 [2018-11-10 04:44:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-10 04:44:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 04:44:56,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-10 04:44:56,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:44:56,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-10 04:44:56,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:44:56,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-10 04:44:56,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:44:56,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2018-11-10 04:44:56,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:56,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 16 states and 18 transitions. [2018-11-10 04:44:56,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 04:44:56,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 04:44:56,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-10 04:44:56,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:44:56,207 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 04:44:56,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-10 04:44:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 04:44:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 04:44:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-10 04:44:56,229 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 04:44:56,229 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 04:44:56,229 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:44:56,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-10 04:44:56,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:56,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:44:56,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:44:56,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:44:56,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 04:44:56,230 INFO L793 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#a~0.base, ~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 0, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 1, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 2, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 3, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy2.base, main_#t~memcpy2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy1.base, foo_#t~memcpy1.offset, foo_~#p~0.base, foo_~#p~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 114#L743 SUMMARY for call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); srcloc: L743 118#L743-1 call foo_#t~memcpy1.base, foo_#t~memcpy1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 125##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 128#$Ultimate##0 #t~loopctr5 := 0; 127#L-1-1 assume !(#t~loopctr5 < size); 124##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 117##Ultimate.C_memcpyEXIT >#25#return; 119#L744 havoc foo_#t~memcpy1.base, foo_#t~memcpy1.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := foo_~#p~0.base, foo_~#p~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc foo_~#p~0.base, foo_~#p~0.offset; 123#L741 assume { :end_inline_foo } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 115#L750 call main_#t~memcpy2.base, main_#t~memcpy2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 116##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 120#$Ultimate##0 #t~loopctr5 := 0; 121#L-1-1 [2018-11-10 04:44:56,231 INFO L795 eck$LassoCheckResult]: Loop: 121#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 121#L-1-1 [2018-11-10 04:44:56,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1325918342, now seen corresponding path program 1 times [2018-11-10 04:44:56,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:56,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:56,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:44:56,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:44:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:44:56,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:44:56,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:44:56,314 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:44:56,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2018-11-10 04:44:56,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:56,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:44:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:56,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:44:56,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:44:56,350 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 04:44:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:44:56,367 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-10 04:44:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:44:56,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2018-11-10 04:44:56,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:56,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 18 transitions. [2018-11-10 04:44:56,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 04:44:56,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 04:44:56,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-10 04:44:56,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:44:56,370 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 04:44:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-10 04:44:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-10 04:44:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 04:44:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-10 04:44:56,372 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 04:44:56,372 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 04:44:56,372 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:44:56,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2018-11-10 04:44:56,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:56,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:44:56,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:44:56,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:44:56,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 04:44:56,373 INFO L793 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#a~0.base, ~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 0, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 1, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 2, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 3, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy2.base, main_#t~memcpy2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy1.base, foo_#t~memcpy1.offset, foo_~#p~0.base, foo_~#p~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 158#L743 SUMMARY for call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); srcloc: L743 165#L743-1 call foo_#t~memcpy1.base, foo_#t~memcpy1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 169##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 172#$Ultimate##0 #t~loopctr5 := 0; 171#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 170#L-1-1 assume !(#t~loopctr5 < size); 168##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 164##Ultimate.C_memcpyEXIT >#25#return; 166#L744 havoc foo_#t~memcpy1.base, foo_#t~memcpy1.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := foo_~#p~0.base, foo_~#p~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc foo_~#p~0.base, foo_~#p~0.offset; 167#L741 assume { :end_inline_foo } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 159#L750 call main_#t~memcpy2.base, main_#t~memcpy2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 160##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 162#$Ultimate##0 #t~loopctr5 := 0; 163#L-1-1 [2018-11-10 04:44:56,374 INFO L795 eck$LassoCheckResult]: Loop: 163#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 163#L-1-1 [2018-11-10 04:44:56,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1781491204, now seen corresponding path program 1 times [2018-11-10 04:44:56,374 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:56,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:44:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:44:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:44:56,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:44:56,428 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/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 [2018-11-10 04:44:56,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:44:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:44:56,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:44:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:44:56,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:44:56,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 04:44:56,539 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:44:56,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 3 times [2018-11-10 04:44:56,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:56,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:56,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:44:56,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:56,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:44:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:44:56,571 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-10 04:44:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:44:56,590 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-10 04:44:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:44:56,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-10 04:44:56,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:56,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 20 transitions. [2018-11-10 04:44:56,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 04:44:56,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 04:44:56,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-11-10 04:44:56,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:44:56,595 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 04:44:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-11-10 04:44:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-10 04:44:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 04:44:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 04:44:56,596 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 04:44:56,596 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 04:44:56,596 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:44:56,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-10 04:44:56,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:56,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:44:56,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:44:56,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:44:56,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 04:44:56,598 INFO L793 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#a~0.base, ~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 0, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 1, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 2, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 3, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true; 249#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy2.base, main_#t~memcpy2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy1.base, foo_#t~memcpy1.offset, foo_~#p~0.base, foo_~#p~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 250#L743 SUMMARY for call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); srcloc: L743 257#L743-1 call foo_#t~memcpy1.base, foo_#t~memcpy1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 261##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 265#$Ultimate##0 #t~loopctr5 := 0; 264#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 262#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 263#L-1-1 assume !(#t~loopctr5 < size); 260##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 256##Ultimate.C_memcpyEXIT >#25#return; 258#L744 havoc foo_#t~memcpy1.base, foo_#t~memcpy1.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := foo_~#p~0.base, foo_~#p~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc foo_~#p~0.base, foo_~#p~0.offset; 259#L741 assume { :end_inline_foo } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 251#L750 call main_#t~memcpy2.base, main_#t~memcpy2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 252##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 254#$Ultimate##0 #t~loopctr5 := 0; 255#L-1-1 [2018-11-10 04:44:56,598 INFO L795 eck$LassoCheckResult]: Loop: 255#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 255#L-1-1 [2018-11-10 04:44:56,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1275619258, now seen corresponding path program 2 times [2018-11-10 04:44:56,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:56,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:44:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:44:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:44:56,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:44:56,661 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/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 [2018-11-10 04:44:56,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:44:56,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:44:56,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:44:56,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:44:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:44:56,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:44:56,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-10 04:44:56,768 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:44:56,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:56,769 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 4 times [2018-11-10 04:44:56,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:44:56,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:56,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:44:56,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:44:56,793 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-10 04:44:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:44:56,823 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-10 04:44:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:44:56,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-11-10 04:44:56,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:56,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 22 transitions. [2018-11-10 04:44:56,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 04:44:56,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 04:44:56,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2018-11-10 04:44:56,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:44:56,826 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 04:44:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2018-11-10 04:44:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-10 04:44:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 04:44:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-10 04:44:56,827 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-10 04:44:56,827 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-10 04:44:56,827 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:44:56,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-11-10 04:44:56,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:56,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:44:56,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:44:56,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:44:56,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 04:44:56,829 INFO L793 eck$LassoCheckResult]: Stem: 353#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#a~0.base, ~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 0, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 1, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 2, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 3, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true; 349#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy2.base, main_#t~memcpy2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy1.base, foo_#t~memcpy1.offset, foo_~#p~0.base, foo_~#p~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 350#L743 SUMMARY for call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); srcloc: L743 357#L743-1 call foo_#t~memcpy1.base, foo_#t~memcpy1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 360##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 361#$Ultimate##0 #t~loopctr5 := 0; 366#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 363#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 364#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 365#L-1-1 assume !(#t~loopctr5 < size); 362##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 356##Ultimate.C_memcpyEXIT >#25#return; 358#L744 havoc foo_#t~memcpy1.base, foo_#t~memcpy1.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := foo_~#p~0.base, foo_~#p~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc foo_~#p~0.base, foo_~#p~0.offset; 359#L741 assume { :end_inline_foo } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 351#L750 call main_#t~memcpy2.base, main_#t~memcpy2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 352##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 354#$Ultimate##0 #t~loopctr5 := 0; 355#L-1-1 [2018-11-10 04:44:56,829 INFO L795 eck$LassoCheckResult]: Loop: 355#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 355#L-1-1 [2018-11-10 04:44:56,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:56,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1556763068, now seen corresponding path program 3 times [2018-11-10 04:44:56,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:56,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:44:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:44:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:44:56,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:44:56,900 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a38b107d-7bda-4d77-872f-956b991c5cce/bin-2019/uautomizer/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 [2018-11-10 04:44:56,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:44:56,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 04:44:56,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:44:56,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:44:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:44:57,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:44:57,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-10 04:44:57,029 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:44:57,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 5 times [2018-11-10 04:44:57,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:57,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:44:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 04:44:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-11-10 04:44:57,077 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 04:44:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:44:57,102 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-10 04:44:57,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:44:57,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-10 04:44:57,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:57,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 24 transitions. [2018-11-10 04:44:57,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 04:44:57,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 04:44:57,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-10 04:44:57,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:44:57,105 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 04:44:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-10 04:44:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-11-10 04:44:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 04:44:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 04:44:57,106 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 04:44:57,106 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 04:44:57,107 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:44:57,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-11-10 04:44:57,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 04:44:57,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:44:57,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:44:57,108 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:44:57,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 04:44:57,108 INFO L793 eck$LassoCheckResult]: Stem: 463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#a~0.base, ~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 0, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 1, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 2, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_$Pointer$.base, write~unchecked~int_old_#memory_$Pointer$.offset, write~unchecked~int_old_#memory_int := #memory_$Pointer$.base, #memory_$Pointer$.offset, #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#a~0.base, ~#a~0.offset + 3, 1;havoc #memory_int;assume (#memory_$Pointer$.base == write~unchecked~int_old_#memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.base[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]] && #memory_$Pointer$.offset == write~unchecked~int_old_#memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := #memory_$Pointer$.offset[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset]]) && #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true; 457#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~memcpy2.base, main_#t~memcpy2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_~#p~1.base, main_~#p~1.offset;assume { :begin_inline_foo } true;havoc foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_#t~memcpy1.base, foo_#t~memcpy1.offset, foo_~#p~0.base, foo_~#p~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_~#p~0.base, foo_~#p~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];foo_#t~malloc0.base, foo_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 458#L743 SUMMARY for call write~$Pointer$(foo_#t~malloc0.base, foo_#t~malloc0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4); srcloc: L743 465#L743-1 call foo_#t~memcpy1.base, foo_#t~memcpy1.offset := #Ultimate.C_memcpy(~#a~0.base, ~#a~0.offset, foo_~#p~0.base, foo_~#p~0.offset, 4);< 468##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 469#$Ultimate##0 #t~loopctr5 := 0; 475#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 471#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 472#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 474#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 473#L-1-1 assume !(#t~loopctr5 < size); 470##Ultimate.C_memcpyFINAL assume #res.base == dest.base && #res.offset == dest.offset; 464##Ultimate.C_memcpyEXIT >#25#return; 466#L744 havoc foo_#t~memcpy1.base, foo_#t~memcpy1.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := foo_~#p~0.base, foo_~#p~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;havoc foo_~#p~0.base, foo_~#p~0.offset; 467#L741 assume { :end_inline_foo } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#p~1.base, main_~#p~1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 459#L750 call main_#t~memcpy2.base, main_#t~memcpy2.offset := #Ultimate.C_memcpy(main_~#p~1.base, main_~#p~1.offset, ~#a~0.base, ~#a~0.offset, 4);< 460##Ultimate.C_memcpyENTRY assume #valid[dest.base] == 1;assume #valid[src.base] == 1;assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 461#$Ultimate##0 #t~loopctr5 := 0; 462#L-1-1 [2018-11-10 04:44:57,108 INFO L795 eck$LassoCheckResult]: Loop: 462#L-1-1 assume #t~loopctr5 < size;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.base[src.base,src.offset + #t~loopctr5 * 1]], #memory_$Pointer$.offset[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_$Pointer$.offset[src.base,src.offset + #t~loopctr5 * 1]];#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr5 * 1 := #memory_int[src.base,src.offset + #t~loopctr5 * 1]];#t~loopctr5 := #t~loopctr5 + 1; 462#L-1-1 [2018-11-10 04:44:57,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:57,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1682286586, now seen corresponding path program 4 times [2018-11-10 04:44:57,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:57,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:57,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:57,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:44:57,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:57,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 6 times [2018-11-10 04:44:57,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:57,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:57,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:44:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:57,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:44:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash 611276634, now seen corresponding path program 5 times [2018-11-10 04:44:57,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:44:57,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:44:57,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:57,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:44:57,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:44:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:44:58,056 WARN L179 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 138 [2018-11-10 04:44:58,199 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 04:44:58,417 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 122 [2018-11-10 04:44:58,563 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-10 04:45:01,811 WARN L179 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 276 DAG size of output: 255 [2018-11-10 04:45:03,136 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 190 [2018-11-10 04:45:06,168 WARN L179 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 210 DAG size of output: 201 [2018-11-10 04:45:06,684 WARN L179 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2018-11-10 04:45:06,686 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:45:06,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:45:06,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:45:06,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:45:06,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:45:06,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:45:06,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:45:06,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:45:06,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-memleak_nexttime_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 04:45:06,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:45:06,686 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:45:06,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:45:06,832 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:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) 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) [2018-11-10 04:45:06,834 INFO L168 Benchmark]: Toolchain (without parser) took 13376.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -50.5 MB). Peak memory consumption was 358.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:45:06,834 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:45:06,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.24 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 921.6 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:45:06,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 921.6 MB in the beginning and 1.2 GB in the end (delta: -233.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:45:06,836 INFO L168 Benchmark]: Boogie Preprocessor took 17.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:45:06,836 INFO L168 Benchmark]: RCFGBuilder took 226.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:45:06,836 INFO L168 Benchmark]: BuchiAutomizer took 12757.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 130.8 MB). Peak memory consumption was 378.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:45:06,839 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.24 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 921.6 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 921.6 MB in the beginning and 1.2 GB in the end (delta: -233.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 226.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12757.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 130.8 MB). Peak memory consumption was 378.8 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...