./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/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 f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/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-0cd3be1 [2018-11-28 11:39:54,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:39:54,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:39:54,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:39:54,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:39:54,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:39:54,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:39:54,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:39:54,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:39:54,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:39:54,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:39:54,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:39:54,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:39:54,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:39:54,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:39:54,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:39:54,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:39:54,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:39:54,054 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:39:54,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:39:54,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:39:54,056 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:39:54,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:39:54,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:39:54,058 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:39:54,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:39:54,060 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:39:54,060 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:39:54,061 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:39:54,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:39:54,062 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:39:54,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:39:54,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:39:54,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:39:54,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:39:54,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:39:54,064 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:39:54,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:39:54,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:39:54,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:39:54,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:39:54,076 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:39:54,076 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:39:54,076 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:39:54,076 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:39:54,077 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:39:54,077 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:39:54,077 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:39:54,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:39:54,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:39:54,077 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:39:54,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:39:54,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:39:54,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:39:54,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:39:54,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:39:54,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:39:54,078 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:39:54,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:39:54,079 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:39:54,079 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:39:54,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:39:54,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:39:54,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:39:54,079 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:39:54,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:39:54,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:39:54,080 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:39:54,081 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:39:54,081 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_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/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 -> f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 [2018-11-28 11:39:54,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:39:54,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:39:54,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:39:54,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:39:54,117 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:39:54,117 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-11-28 11:39:54,163 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/data/777593019/cab8491499574aeb961899aa3d88aac7/FLAG2a8e2347e [2018-11-28 11:39:54,514 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:39:54,514 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-11-28 11:39:54,521 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/data/777593019/cab8491499574aeb961899aa3d88aac7/FLAG2a8e2347e [2018-11-28 11:39:54,531 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/bin-2019/uautomizer/data/777593019/cab8491499574aeb961899aa3d88aac7 [2018-11-28 11:39:54,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:39:54,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:39:54,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:39:54,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:39:54,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:39:54,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b7394e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54, skipping insertion in model container [2018-11-28 11:39:54,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:39:54,571 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:39:54,747 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:39:54,754 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:39:54,825 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:39:54,857 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:39:54,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54 WrapperNode [2018-11-28 11:39:54,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:39:54,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:39:54,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:39:54,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:39:54,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:39:54,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:39:54,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:39:54,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:39:54,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... [2018-11-28 11:39:54,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:39:54,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:39:54,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:39:54,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:39:54,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/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-28 11:39:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:39:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:39:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:39:54,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:39:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 11:39:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:39:54,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:39:55,130 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:39:55,130 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:39:55,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:39:55 BoogieIcfgContainer [2018-11-28 11:39:55,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:39:55,131 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:39:55,131 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:39:55,135 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:39:55,135 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:39:55,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:39:54" (1/3) ... [2018-11-28 11:39:55,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d37eea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:39:55, skipping insertion in model container [2018-11-28 11:39:55,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:39:55,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:54" (2/3) ... [2018-11-28 11:39:55,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d37eea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:39:55, skipping insertion in model container [2018-11-28 11:39:55,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:39:55,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:39:55" (3/3) ... [2018-11-28 11:39:55,139 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-11-28 11:39:55,177 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:39:55,178 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:39:55,178 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:39:55,178 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:39:55,178 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:39:55,178 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:39:55,178 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:39:55,178 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:39:55,178 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:39:55,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 11:39:55,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 11:39:55,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:39:55,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:39:55,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:39:55,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:39:55,206 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:39:55,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 11:39:55,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 11:39:55,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:39:55,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:39:55,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:39:55,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:39:55,212 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 4#L-1true havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 10#L639-3true [2018-11-28 11:39:55,213 INFO L796 eck$LassoCheckResult]: Loop: 10#L639-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 3#L630true assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 5#L630-2true call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 12#L625true main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 7#L639-1true assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 10#L639-3true [2018-11-28 11:39:55,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:39:55,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:39:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:39:55,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:55,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:39:55,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:55,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:55,290 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2018-11-28 11:39:55,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:39:55,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:39:55,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:55,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:39:55,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:55,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2018-11-28 11:39:55,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:39:55,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:39:55,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:55,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:39:55,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:39:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:39:55,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:39:55,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:39:55,885 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 123 [2018-11-28 11:39:56,179 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-28 11:39:56,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:39:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:39:56,190 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-11-28 11:39:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:39:56,227 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-28 11:39:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:39:56,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-28 11:39:56,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 11:39:56,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2018-11-28 11:39:56,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 11:39:56,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 11:39:56,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-28 11:39:56,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:39:56,235 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 11:39:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-28 11:39:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-11-28 11:39:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 11:39:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-28 11:39:56,252 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 11:39:56,252 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 11:39:56,252 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:39:56,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-28 11:39:56,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 11:39:56,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:39:56,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:39:56,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:39:56,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 11:39:56,253 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 46#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 47#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 54#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 44#L630-2 [2018-11-28 11:39:56,253 INFO L796 eck$LassoCheckResult]: Loop: 44#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 45#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 49#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 51#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 53#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 44#L630-2 [2018-11-28 11:39:56,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2018-11-28 11:39:56,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:39:56,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:39:56,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:56,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:39:56,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:56,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2018-11-28 11:39:56,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:39:56,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:39:56,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:56,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:39:56,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:56,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2018-11-28 11:39:56,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:39:56,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:39:56,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:56,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:39:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:39:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:56,790 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2018-11-28 11:39:57,386 WARN L180 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-28 11:39:57,565 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-11-28 11:39:57,662 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:39:57,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:39:57,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:39:57,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:39:57,663 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:39:57,663 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:39:57,663 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:39:57,664 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:39:57,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-28 11:39:57,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:39:57,664 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:39:57,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:57,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-28 11:39:57,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-28 11:39:57,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-28 11:39:57,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-28 11:39:57,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:57,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:57,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:57,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-28 11:39:57,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-28 11:39:57,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-28 11:39:57,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:57,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-28 11:39:57,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-28 11:39:57,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-28 11:39:57,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:57,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-28 11:39:57,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-28 11:39:57,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:57,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-28 11:39:58,604 WARN L180 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-11-28 11:39:58,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:39:58,841 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 11:39:59,068 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-28 11:40:00,765 WARN L180 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-28 11:40:00,821 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:40:00,824 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:40:00,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:00,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:00,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:00,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:00,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:00,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:00,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:00,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:00,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:00,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:00,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:00,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:00,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:00,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:00,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:00,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:40:00,890 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 11:40:00,890 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:40:00,892 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:40:00,893 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:40:00,894 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:40:00,894 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2018-11-28 11:40:00,921 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 11:40:00,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:00,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:00,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:00,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:40:00,998 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 11:40:01,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 19 states and 26 transitions. Complement of second has 6 states. [2018-11-28 11:40:01,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:40:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:40:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 11:40:01,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-28 11:40:01,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:01,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-28 11:40:01,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:01,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-28 11:40:01,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:01,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-28 11:40:01,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:40:01,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2018-11-28 11:40:01,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 11:40:01,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:40:01,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-28 11:40:01,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:40:01,034 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 11:40:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-28 11:40:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 11:40:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:40:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 11:40:01,035 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 11:40:01,035 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 11:40:01,036 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:40:01,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 11:40:01,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:40:01,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:01,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:01,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:40:01,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:40:01,037 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 157#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 158#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 165#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 167#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 154#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 160#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 161#L639-4 assume !(main_~length~0 > 0); 159#L650-1 [2018-11-28 11:40:01,037 INFO L796 eck$LassoCheckResult]: Loop: 159#L650-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 159#L650-1 [2018-11-28 11:40:01,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 149888852, now seen corresponding path program 1 times [2018-11-28 11:40:01,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:01,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:01,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:40:01,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:40:01,062 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:40:01,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,062 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2018-11-28 11:40:01,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:01,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:40:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:40:01,146 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 11:40:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:40:01,164 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-28 11:40:01,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:40:01,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-28 11:40:01,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:40:01,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2018-11-28 11:40:01,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:40:01,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:40:01,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-28 11:40:01,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:40:01,165 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-28 11:40:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-28 11:40:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-28 11:40:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:40:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 11:40:01,166 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 11:40:01,166 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 11:40:01,167 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:40:01,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 11:40:01,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:40:01,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:01,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:01,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:40:01,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:40:01,167 INFO L794 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 192#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 193#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 204#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 206#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 195#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 199#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 200#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 198#L650-1 [2018-11-28 11:40:01,167 INFO L796 eck$LassoCheckResult]: Loop: 198#L650-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 198#L650-1 [2018-11-28 11:40:01,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash 149888850, now seen corresponding path program 1 times [2018-11-28 11:40:01,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2018-11-28 11:40:01,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:01,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,210 INFO L82 PathProgramCache]: Analyzing trace with hash 351587092, now seen corresponding path program 1 times [2018-11-28 11:40:01,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:01,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:40:01,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:40:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:40:01,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:40:01,318 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 11:40:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:40:01,327 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-28 11:40:01,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:40:01,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2018-11-28 11:40:01,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:40:01,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 29 transitions. [2018-11-28 11:40:01,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 11:40:01,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:40:01,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-28 11:40:01,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:40:01,329 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-28 11:40:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-28 11:40:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-11-28 11:40:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:40:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 11:40:01,330 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:40:01,330 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:40:01,330 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:40:01,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 11:40:01,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:40:01,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:01,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:01,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 11:40:01,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:40:01,331 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 247#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 248#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 255#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 244#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 245#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 252#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 253#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 256#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 258#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 257#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 250#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 251#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 249#L650-1 [2018-11-28 11:40:01,331 INFO L796 eck$LassoCheckResult]: Loop: 249#L650-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 249#L650-1 [2018-11-28 11:40:01,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash -315524230, now seen corresponding path program 1 times [2018-11-28 11:40:01,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:01,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:01,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:40:01,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d62e1fb3-882f-4b2f-b238-4f2e15c1b6d2/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-28 11:40:01,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:01,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:01,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-28 11:40:01,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:40:01,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:01,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 11:40:01,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-28 11:40:01,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:40:01,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-28 11:40:01,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:01,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:40:01,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:40:01,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:40:01,590 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2018-11-28 11:40:01,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 11:40:01,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 11:40:01,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:01,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:01,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:01,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-28 11:40:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:01,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:40:01,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-28 11:40:01,624 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:40:01,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2018-11-28 11:40:01,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:40:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:40:01,703 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 11:40:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:40:01,741 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-28 11:40:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:40:01,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-11-28 11:40:01,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:40:01,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-11-28 11:40:01,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 11:40:01,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:40:01,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-11-28 11:40:01,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:40:01,742 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 11:40:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-11-28 11:40:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 11:40:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:40:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-28 11:40:01,744 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 11:40:01,744 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 11:40:01,744 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:40:01,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-28 11:40:01,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:40:01,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:01,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:01,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:40:01,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:40:01,746 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~c~0 := 0; 329#L-1 havoc main_#res;havoc main_#t~post9, main_#t~nondet8, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~post15, main_~next~0.base, main_~next~0.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~post19, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 330#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 337#L630 assume !(append_#t~mem3.base != 0 || append_#t~mem3.offset != 0);call append_#t~malloc6.base, append_#t~malloc6.offset := #Ultimate.alloc(8);append_#t~ite7.base, append_#t~ite7.offset := append_#t~malloc6.base, append_#t~malloc6.offset; 339#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 328#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 334#L639-1 assume !!(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 335#L639-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post0, append_#t~malloc1.base, append_#t~malloc1.offset, append_#t~mem2.base, append_#t~mem2.offset, append_#t~mem3.base, append_#t~mem3.offset, append_#t~ite7.base, append_#t~ite7.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~malloc6.base, append_#t~malloc6.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post0 := ~c~0;~c~0 := 1 + append_#t~post0;havoc append_#t~post0;call append_#t~malloc1.base, append_#t~malloc1.offset := #Ultimate.alloc(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc1.base, append_#t~malloc1.offset;call append_#t~mem2.base, append_#t~mem2.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem2.base, append_#t~mem2.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem2.base, append_#t~mem2.offset;call append_#t~mem3.base, append_#t~mem3.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 338#L630 assume append_#t~mem3.base != 0 || append_#t~mem3.offset != 0;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_#t~mem4.base, 4 + append_#t~mem4.offset, 4);append_#t~ite7.base, append_#t~ite7.offset := append_#t~mem5.base, append_#t~mem5.offset; 325#L630-2 call write~$Pointer$(append_#t~ite7.base, append_#t~ite7.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;havoc append_#t~ite7.base, append_#t~ite7.offset;havoc append_#t~mem3.base, append_#t~mem3.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 326#L625 main_#t~post9 := main_~length~0;main_~length~0 := 1 + main_#t~post9;havoc main_#t~post9; 332#L639-1 assume !(0 != main_#t~nondet8 && ~c~0 < 20);havoc main_#t~nondet8; 333#L639-4 assume main_~length~0 > 0;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_#t~mem10.base, main_#t~mem10.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);call ULTIMATE.dealloc(main_#t~mem13.base, main_#t~mem13.offset);havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem14.base, main_#t~mem14.offset);havoc main_#t~mem14.base, main_#t~mem14.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post15 := main_~length~0;main_~length~0 := main_#t~post15 - 1;havoc main_#t~post15; 331#L650-1 [2018-11-28 11:40:01,746 INFO L796 eck$LassoCheckResult]: Loop: 331#L650-1 assume !!(main_~length~0 > 0);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_#t~mem16.base, main_#t~mem16.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem18.base, main_#t~mem18.offset);havoc main_#t~mem18.base, main_#t~mem18.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post19 := main_~length~0;main_~length~0 := main_#t~post19 - 1;havoc main_#t~post19; 331#L650-1 [2018-11-28 11:40:01,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -317371272, now seen corresponding path program 1 times [2018-11-28 11:40:01,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,781 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 4 times [2018-11-28 11:40:01,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1248574802, now seen corresponding path program 1 times [2018-11-28 11:40:01,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:01,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:01,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:01,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:06,016 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 315 DAG size of output: 249 [2018-11-28 11:40:06,546 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2018-11-28 11:40:06,548 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:40:06,548 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:40:06,548 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:40:06,548 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:40:06,548 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:40:06,548 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:40:06,548 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:40:06,548 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:40:06,548 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-0232_1_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-28 11:40:06,549 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:40:06,549 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:40:06,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,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-28 11:40:06,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:06,865 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-28 11:40:06,867 INFO L168 Benchmark]: Toolchain (without parser) took 12333.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.0 MB). Free memory was 951.7 MB in the beginning and 900.9 MB in the end (delta: 50.8 MB). Peak memory consumption was 416.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:40:06,867 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:40:06,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:40:06,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:40:06,868 INFO L168 Benchmark]: Boogie Preprocessor took 15.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:40:06,868 INFO L168 Benchmark]: RCFGBuilder took 227.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:40:06,869 INFO L168 Benchmark]: BuchiAutomizer took 11735.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 900.9 MB in the end (delta: 189.0 MB). Peak memory consumption was 422.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:40:06,870 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 227.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11735.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 900.9 MB in the end (delta: 189.0 MB). Peak memory consumption was 422.8 MB. Max. memory is 11.5 GB. * 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...