./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0513.i -s /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d166d612464eb82f26cf6bd810bec52eb6c5e35a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0513.i -s /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d166d612464eb82f26cf6bd810bec52eb6c5e35a ...................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:53,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:53,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:53,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:53,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:53,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:53,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:53,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:53,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:53,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:53,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:53,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:53,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:53,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:53,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:53,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:53,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:53,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:53,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:53,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:53,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:53,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:53,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:53,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:53,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:53,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:53,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:53,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:53,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:53,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:53,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:53,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:53,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:53,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:53,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:53,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:53,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:53,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:53,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:53,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:53,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:53,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:21:53,275 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:53,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:53,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:53,276 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:53,277 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:53,277 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:53,277 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:53,277 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:53,277 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:53,278 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:53,278 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:53,278 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:53,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:21:53,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:21:53,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:53,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:53,280 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:21:53,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:53,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:53,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:53,281 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:21:53,281 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:21:53,281 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:21:53,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:53,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:53,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:53,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:53,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:53,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:53,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:53,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:53,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:53,283 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:53,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:53,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:53,284 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> d166d612464eb82f26cf6bd810bec52eb6c5e35a [2019-10-22 11:21:53,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:53,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:53,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:53,348 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:53,348 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:53,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0513.i [2019-10-22 11:21:53,411 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data/7d59f3c3c/9e031387c2894d5a9f189c4674ddabcd/FLAG984075f88 [2019-10-22 11:21:53,891 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:53,892 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/sv-benchmarks/c/memsafety/test-0513.i [2019-10-22 11:21:53,906 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data/7d59f3c3c/9e031387c2894d5a9f189c4674ddabcd/FLAG984075f88 [2019-10-22 11:21:54,198 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data/7d59f3c3c/9e031387c2894d5a9f189c4674ddabcd [2019-10-22 11:21:54,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:54,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:54,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:54,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:54,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:54,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c4d0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54, skipping insertion in model container [2019-10-22 11:21:54,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,217 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:54,256 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:54,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:54,661 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:54,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:54,763 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:54,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54 WrapperNode [2019-10-22 11:21:54,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:54,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:54,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:54,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:54,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:54,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:54,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:54,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:54,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... [2019-10-22 11:21:54,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:54,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:54,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:54,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:54,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:21:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:21:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:54,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:55,693 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:55,693 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:21:55,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:55 BoogieIcfgContainer [2019-10-22 11:21:55,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:55,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:55,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:55,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:55,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:54" (1/3) ... [2019-10-22 11:21:55,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1419954c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:55, skipping insertion in model container [2019-10-22 11:21:55,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:54" (2/3) ... [2019-10-22 11:21:55,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1419954c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:55, skipping insertion in model container [2019-10-22 11:21:55,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:55" (3/3) ... [2019-10-22 11:21:55,708 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0513.i [2019-10-22 11:21:55,719 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:55,731 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 62 error locations. [2019-10-22 11:21:55,741 INFO L249 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2019-10-22 11:21:55,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:55,760 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:21:55,761 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:55,761 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:55,761 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:55,761 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:55,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:55,761 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-10-22 11:21:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:21:55,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:21:55,792 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash 28740643, now seen corresponding path program 1 times [2019-10-22 11:21:55,809 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232136422] [2019-10-22 11:21:55,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,809 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:55,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232136422] [2019-10-22 11:21:55,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:55,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214383360] [2019-10-22 11:21:55,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:21:55,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:21:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:21:55,946 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 2 states. [2019-10-22 11:21:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,969 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-10-22 11:21:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:21:55,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-10-22 11:21:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,982 INFO L225 Difference]: With dead ends: 132 [2019-10-22 11:21:55,982 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 11:21:55,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:21:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 11:21:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-10-22 11:21:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-22 11:21:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-10-22 11:21:56,027 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2019-10-22 11:21:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,027 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-10-22 11:21:56,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:21:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-10-22 11:21:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:21:56,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,029 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash 889570808, now seen corresponding path program 1 times [2019-10-22 11:21:56,030 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842099418] [2019-10-22 11:21:56,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:56,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842099418] [2019-10-22 11:21:56,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:56,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814697020] [2019-10-22 11:21:56,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:56,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:56,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,069 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 3 states. [2019-10-22 11:21:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,235 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2019-10-22 11:21:56,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:56,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:21:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,237 INFO L225 Difference]: With dead ends: 176 [2019-10-22 11:21:56,237 INFO L226 Difference]: Without dead ends: 175 [2019-10-22 11:21:56,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-22 11:21:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2019-10-22 11:21:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-22 11:21:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2019-10-22 11:21:56,248 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2019-10-22 11:21:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,248 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2019-10-22 11:21:56,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2019-10-22 11:21:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:21:56,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,250 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash 889570732, now seen corresponding path program 1 times [2019-10-22 11:21:56,250 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018251196] [2019-10-22 11:21:56,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:56,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018251196] [2019-10-22 11:21:56,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:56,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056970926] [2019-10-22 11:21:56,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:56,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:56,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,276 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand 3 states. [2019-10-22 11:21:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,347 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2019-10-22 11:21:56,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:56,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:21:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,348 INFO L225 Difference]: With dead ends: 145 [2019-10-22 11:21:56,349 INFO L226 Difference]: Without dead ends: 144 [2019-10-22 11:21:56,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-22 11:21:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2019-10-22 11:21:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-22 11:21:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2019-10-22 11:21:56,357 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2019-10-22 11:21:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,357 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2019-10-22 11:21:56,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2019-10-22 11:21:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:21:56,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,358 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,358 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2019-10-22 11:21:56,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638254076] [2019-10-22 11:21:56,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:56,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638254076] [2019-10-22 11:21:56,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:56,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52726465] [2019-10-22 11:21:56,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:56,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,394 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 3 states. [2019-10-22 11:21:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,690 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2019-10-22 11:21:56,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:56,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:21:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,693 INFO L225 Difference]: With dead ends: 169 [2019-10-22 11:21:56,693 INFO L226 Difference]: Without dead ends: 169 [2019-10-22 11:21:56,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-22 11:21:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2019-10-22 11:21:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-22 11:21:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2019-10-22 11:21:56,714 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 6 [2019-10-22 11:21:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,715 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2019-10-22 11:21:56,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2019-10-22 11:21:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:21:56,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,719 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,719 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2019-10-22 11:21:56,720 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912161076] [2019-10-22 11:21:56,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:56,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912161076] [2019-10-22 11:21:56,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:56,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780814918] [2019-10-22 11:21:56,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:56,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:56,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,795 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 3 states. [2019-10-22 11:21:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,924 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2019-10-22 11:21:56,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:56,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:21:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,925 INFO L225 Difference]: With dead ends: 137 [2019-10-22 11:21:56,926 INFO L226 Difference]: Without dead ends: 137 [2019-10-22 11:21:56,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-22 11:21:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-10-22 11:21:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-22 11:21:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2019-10-22 11:21:56,938 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2019-10-22 11:21:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,938 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2019-10-22 11:21:56,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2019-10-22 11:21:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:21:56,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,947 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,948 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2119659887, now seen corresponding path program 1 times [2019-10-22 11:21:56,949 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071208237] [2019-10-22 11:21:56,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071208237] [2019-10-22 11:21:57,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:57,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526287169] [2019-10-22 11:21:57,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:57,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:57,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:57,025 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 3 states. [2019-10-22 11:21:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,126 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2019-10-22 11:21:57,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:57,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 11:21:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,128 INFO L225 Difference]: With dead ends: 133 [2019-10-22 11:21:57,128 INFO L226 Difference]: Without dead ends: 133 [2019-10-22 11:21:57,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-22 11:21:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-22 11:21:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-22 11:21:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2019-10-22 11:21:57,135 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2019-10-22 11:21:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,135 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2019-10-22 11:21:57,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2019-10-22 11:21:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:21:57,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,137 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2119659886, now seen corresponding path program 1 times [2019-10-22 11:21:57,138 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576767916] [2019-10-22 11:21:57,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576767916] [2019-10-22 11:21:57,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:57,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425725875] [2019-10-22 11:21:57,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:57,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:57,216 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 3 states. [2019-10-22 11:21:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,312 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2019-10-22 11:21:57,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:57,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 11:21:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,314 INFO L225 Difference]: With dead ends: 130 [2019-10-22 11:21:57,314 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 11:21:57,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 11:21:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-10-22 11:21:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-22 11:21:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-10-22 11:21:57,320 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2019-10-22 11:21:57,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,321 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-10-22 11:21:57,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-10-22 11:21:57,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:57,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,322 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,322 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash -967503371, now seen corresponding path program 1 times [2019-10-22 11:21:57,323 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994251547] [2019-10-22 11:21:57,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994251547] [2019-10-22 11:21:57,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:57,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561894149] [2019-10-22 11:21:57,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:57,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:57,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:57,426 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 4 states. [2019-10-22 11:21:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,587 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2019-10-22 11:21:57,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:57,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 11:21:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,589 INFO L225 Difference]: With dead ends: 228 [2019-10-22 11:21:57,589 INFO L226 Difference]: Without dead ends: 228 [2019-10-22 11:21:57,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-22 11:21:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2019-10-22 11:21:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-22 11:21:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2019-10-22 11:21:57,610 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2019-10-22 11:21:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,611 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2019-10-22 11:21:57,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2019-10-22 11:21:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:57,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,612 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,612 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash -967503447, now seen corresponding path program 1 times [2019-10-22 11:21:57,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880600993] [2019-10-22 11:21:57,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880600993] [2019-10-22 11:21:57,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:57,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225771808] [2019-10-22 11:21:57,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:57,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:57,707 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 5 states. [2019-10-22 11:21:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,886 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-10-22 11:21:57,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:57,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-22 11:21:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,887 INFO L225 Difference]: With dead ends: 124 [2019-10-22 11:21:57,887 INFO L226 Difference]: Without dead ends: 124 [2019-10-22 11:21:57,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-22 11:21:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-10-22 11:21:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-22 11:21:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2019-10-22 11:21:57,896 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2019-10-22 11:21:57,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,897 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2019-10-22 11:21:57,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2019-10-22 11:21:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:57,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,898 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,898 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,898 INFO L82 PathProgramCache]: Analyzing trace with hash -967503446, now seen corresponding path program 1 times [2019-10-22 11:21:57,898 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830435433] [2019-10-22 11:21:57,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830435433] [2019-10-22 11:21:57,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:57,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284611515] [2019-10-22 11:21:57,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:57,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:57,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:57,991 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 4 states. [2019-10-22 11:21:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:58,231 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2019-10-22 11:21:58,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:58,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 11:21:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:58,233 INFO L225 Difference]: With dead ends: 204 [2019-10-22 11:21:58,233 INFO L226 Difference]: Without dead ends: 204 [2019-10-22 11:21:58,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-22 11:21:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2019-10-22 11:21:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-22 11:21:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2019-10-22 11:21:58,239 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 18 [2019-10-22 11:21:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:58,239 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2019-10-22 11:21:58,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2019-10-22 11:21:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:58,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:58,241 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:58,241 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash 199814016, now seen corresponding path program 1 times [2019-10-22 11:21:58,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:58,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523900325] [2019-10-22 11:21:58,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:58,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:58,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:58,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523900325] [2019-10-22 11:21:58,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:58,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:58,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904448638] [2019-10-22 11:21:58,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:58,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:58,329 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand 4 states. [2019-10-22 11:21:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:58,449 INFO L93 Difference]: Finished difference Result 203 states and 222 transitions. [2019-10-22 11:21:58,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:58,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-22 11:21:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:58,452 INFO L225 Difference]: With dead ends: 203 [2019-10-22 11:21:58,452 INFO L226 Difference]: Without dead ends: 203 [2019-10-22 11:21:58,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-22 11:21:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 163. [2019-10-22 11:21:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 11:21:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2019-10-22 11:21:58,456 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 23 [2019-10-22 11:21:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:58,457 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2019-10-22 11:21:58,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2019-10-22 11:21:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:58,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:58,458 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:58,458 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash 198674982, now seen corresponding path program 1 times [2019-10-22 11:21:58,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:58,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363928077] [2019-10-22 11:21:58,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:58,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:58,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:58,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363928077] [2019-10-22 11:21:58,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:58,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:58,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525039594] [2019-10-22 11:21:58,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:58,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:58,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:58,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:58,576 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand 6 states. [2019-10-22 11:21:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:58,778 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2019-10-22 11:21:58,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:58,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-22 11:21:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:58,780 INFO L225 Difference]: With dead ends: 191 [2019-10-22 11:21:58,780 INFO L226 Difference]: Without dead ends: 191 [2019-10-22 11:21:58,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-22 11:21:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2019-10-22 11:21:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-22 11:21:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2019-10-22 11:21:58,785 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 23 [2019-10-22 11:21:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:58,786 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2019-10-22 11:21:58,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2019-10-22 11:21:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:21:58,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:58,796 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:58,797 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash -165115758, now seen corresponding path program 1 times [2019-10-22 11:21:58,797 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:58,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546847689] [2019-10-22 11:21:58,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:58,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:58,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:59,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546847689] [2019-10-22 11:21:59,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:59,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:59,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365229314] [2019-10-22 11:21:59,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:59,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:59,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:59,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:59,061 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand 10 states. [2019-10-22 11:21:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:59,695 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2019-10-22 11:21:59,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:21:59,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-22 11:21:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:59,697 INFO L225 Difference]: With dead ends: 228 [2019-10-22 11:21:59,697 INFO L226 Difference]: Without dead ends: 228 [2019-10-22 11:21:59,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:21:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-22 11:21:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2019-10-22 11:21:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-22 11:21:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2019-10-22 11:21:59,702 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 26 [2019-10-22 11:21:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:59,702 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2019-10-22 11:21:59,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2019-10-22 11:21:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:21:59,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:59,703 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:59,703 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:21:59,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:59,704 INFO L82 PathProgramCache]: Analyzing trace with hash -165115757, now seen corresponding path program 1 times [2019-10-22 11:21:59,704 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:59,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196904068] [2019-10-22 11:21:59,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:59,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:59,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:59,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196904068] [2019-10-22 11:21:59,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:59,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:59,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579407991] [2019-10-22 11:21:59,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:59,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:59,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:59,980 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand 10 states. [2019-10-22 11:22:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:00,537 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2019-10-22 11:22:00,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:22:00,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-22 11:22:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:00,538 INFO L225 Difference]: With dead ends: 207 [2019-10-22 11:22:00,539 INFO L226 Difference]: Without dead ends: 207 [2019-10-22 11:22:00,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:22:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-22 11:22:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 177. [2019-10-22 11:22:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-22 11:22:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2019-10-22 11:22:00,543 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 26 [2019-10-22 11:22:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:00,544 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2019-10-22 11:22:00,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:22:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2019-10-22 11:22:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:22:00,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:00,545 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:00,545 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:22:00,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash -823622550, now seen corresponding path program 1 times [2019-10-22 11:22:00,546 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:00,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740232074] [2019-10-22 11:22:00,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:00,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:00,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:00,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740232074] [2019-10-22 11:22:00,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:00,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:22:00,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563657222] [2019-10-22 11:22:00,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:22:00,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:00,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:22:00,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:22:00,765 INFO L87 Difference]: Start difference. First operand 177 states and 222 transitions. Second operand 10 states. [2019-10-22 11:22:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:01,133 INFO L93 Difference]: Finished difference Result 204 states and 248 transitions. [2019-10-22 11:22:01,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:22:01,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-22 11:22:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:01,134 INFO L225 Difference]: With dead ends: 204 [2019-10-22 11:22:01,135 INFO L226 Difference]: Without dead ends: 204 [2019-10-22 11:22:01,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:22:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-22 11:22:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 177. [2019-10-22 11:22:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-22 11:22:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2019-10-22 11:22:01,139 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 27 [2019-10-22 11:22:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:01,140 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2019-10-22 11:22:01,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:22:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2019-10-22 11:22:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:22:01,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:01,141 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:01,141 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:22:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash 237551634, now seen corresponding path program 1 times [2019-10-22 11:22:01,141 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:01,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796055705] [2019-10-22 11:22:01,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:01,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:01,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:01,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796055705] [2019-10-22 11:22:01,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:01,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:22:01,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758824807] [2019-10-22 11:22:01,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:22:01,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:01,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:22:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:01,292 INFO L87 Difference]: Start difference. First operand 177 states and 221 transitions. Second operand 9 states. [2019-10-22 11:22:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:01,604 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2019-10-22 11:22:01,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:22:01,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-10-22 11:22:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:01,605 INFO L225 Difference]: With dead ends: 229 [2019-10-22 11:22:01,606 INFO L226 Difference]: Without dead ends: 229 [2019-10-22 11:22:01,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:22:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-22 11:22:01,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 179. [2019-10-22 11:22:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-22 11:22:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2019-10-22 11:22:01,611 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 28 [2019-10-22 11:22:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:01,611 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2019-10-22 11:22:01,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:22:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2019-10-22 11:22:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:22:01,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:01,612 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:01,613 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:22:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1225833714, now seen corresponding path program 1 times [2019-10-22 11:22:01,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:01,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144140888] [2019-10-22 11:22:01,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:01,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:01,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:01,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144140888] [2019-10-22 11:22:01,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:01,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:22:01,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530279519] [2019-10-22 11:22:01,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:22:01,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:01,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:22:01,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:22:01,788 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand 10 states. [2019-10-22 11:22:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:02,173 INFO L93 Difference]: Finished difference Result 210 states and 254 transitions. [2019-10-22 11:22:02,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:22:02,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-10-22 11:22:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:02,175 INFO L225 Difference]: With dead ends: 210 [2019-10-22 11:22:02,175 INFO L226 Difference]: Without dead ends: 210 [2019-10-22 11:22:02,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:22:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-22 11:22:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 180. [2019-10-22 11:22:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 11:22:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2019-10-22 11:22:02,180 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 29 [2019-10-22 11:22:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:02,181 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2019-10-22 11:22:02,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:22:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2019-10-22 11:22:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:22:02,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:02,182 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:02,183 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:22:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash 653860756, now seen corresponding path program 1 times [2019-10-22 11:22:02,183 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:02,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931358862] [2019-10-22 11:22:02,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:02,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:02,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:22:02,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931358862] [2019-10-22 11:22:02,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:02,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:02,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839228788] [2019-10-22 11:22:02,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:02,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:02,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:02,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:02,225 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand 4 states. [2019-10-22 11:22:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:02,365 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2019-10-22 11:22:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:02,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-22 11:22:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:02,366 INFO L225 Difference]: With dead ends: 251 [2019-10-22 11:22:02,366 INFO L226 Difference]: Without dead ends: 251 [2019-10-22 11:22:02,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-22 11:22:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 184. [2019-10-22 11:22:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-22 11:22:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2019-10-22 11:22:02,370 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 30 [2019-10-22 11:22:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:02,370 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2019-10-22 11:22:02,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2019-10-22 11:22:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:02,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:02,371 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:02,371 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION]=== [2019-10-22 11:22:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:02,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1294968215, now seen corresponding path program 1 times [2019-10-22 11:22:02,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:02,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383851307] [2019-10-22 11:22:02,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:02,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:02,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:02,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383851307] [2019-10-22 11:22:02,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358605842] [2019-10-22 11:22:02,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:02,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-22 11:22:02,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:02,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:22:02,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:02,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:02,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:22:02,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:02,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:02,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:02,981 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-10-22 11:22:03,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:03,020 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-22 11:22:03,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:03,040 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-22 11:22:03,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2019-10-22 11:22:03,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 11:22:03,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-10-22 11:22:03,141 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-22 11:22:03,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,167 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-22 11:22:03,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2019-10-22 11:22:03,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:03,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-10-22 11:22:03,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:03,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-10-22 11:22:03,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:03,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:03,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:71, output treesize:87 [2019-10-22 11:22:03,820 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-10-22 11:22:03,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:03,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:03,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:22:03,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2019-10-22 11:22:03,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,864 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:03,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:03,909 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:22:03,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:03,914 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:22:03,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:03,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 83 [2019-10-22 11:22:03,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:03,968 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:04,015 INFO L567 ElimStorePlain]: treesize reduction 48, result has 48.4 percent of original size [2019-10-22 11:22:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:04,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:04,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-22 11:22:04,022 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:125, output treesize:37 [2019-10-22 11:22:04,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:04,155 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:04,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:04,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:05,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:05,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:05,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:05,598 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:22:05,603 INFO L168 Benchmark]: Toolchain (without parser) took 11400.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.1 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 123.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:05,603 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:05,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:05,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.16 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:05,604 INFO L168 Benchmark]: Boogie Preprocessor took 34.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:05,604 INFO L168 Benchmark]: RCFGBuilder took 832.16 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:05,605 INFO L168 Benchmark]: TraceAbstraction took 9904.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.2 MB). Peak memory consumption was 113.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:05,607 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 561.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.16 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.67 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 832.16 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9904.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.2 MB). Peak memory consumption was 113.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:07,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:07,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:07,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:07,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:07,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:07,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:07,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:07,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:07,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:07,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:07,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:07,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:07,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:07,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:07,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:07,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:07,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:07,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:07,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:07,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:07,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:07,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:07,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:07,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:07,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:07,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:07,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:07,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:07,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:07,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:07,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:07,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:07,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:07,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:07,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:07,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:07,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:07,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:07,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:07,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:07,961 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:22:07,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:07,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:07,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:07,977 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:07,977 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:07,977 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:07,977 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:07,978 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:07,978 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:07,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:22:07,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:22:07,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:07,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:07,980 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:22:07,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:07,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:07,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:07,980 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:22:07,981 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:22:07,981 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:22:07,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:07,981 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:22:07,981 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:22:07,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:07,982 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:22:07,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:07,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:07,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:07,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:07,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:07,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:07,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:07,984 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:22:07,984 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:22:07,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:07,984 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> d166d612464eb82f26cf6bd810bec52eb6c5e35a [2019-10-22 11:22:08,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:08,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:08,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:08,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:08,034 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:08,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0513.i [2019-10-22 11:22:08,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data/2d14c8e12/22448ff571754e54bf7ac3a62c259141/FLAG531db4d46 [2019-10-22 11:22:08,548 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:08,549 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/sv-benchmarks/c/memsafety/test-0513.i [2019-10-22 11:22:08,565 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data/2d14c8e12/22448ff571754e54bf7ac3a62c259141/FLAG531db4d46 [2019-10-22 11:22:08,881 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/data/2d14c8e12/22448ff571754e54bf7ac3a62c259141 [2019-10-22 11:22:08,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:08,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:08,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:08,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:08,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:08,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b767899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08, skipping insertion in model container [2019-10-22 11:22:08,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,904 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:08,944 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:09,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:09,375 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:09,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:09,496 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:09,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09 WrapperNode [2019-10-22 11:22:09,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:09,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:09,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:09,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:09,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:09,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:09,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:09,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:09,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... [2019-10-22 11:22:09,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:09,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:09,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:09,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:09,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:22:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:09,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:22:09,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:09,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:10,507 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:10,507 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:22:10,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:10 BoogieIcfgContainer [2019-10-22 11:22:10,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:10,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:10,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:10,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:10,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:08" (1/3) ... [2019-10-22 11:22:10,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c6e45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:10, skipping insertion in model container [2019-10-22 11:22:10,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:09" (2/3) ... [2019-10-22 11:22:10,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c6e45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:10, skipping insertion in model container [2019-10-22 11:22:10,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:10" (3/3) ... [2019-10-22 11:22:10,517 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0513.i [2019-10-22 11:22:10,529 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:10,543 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 62 error locations. [2019-10-22 11:22:10,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2019-10-22 11:22:10,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:10,574 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:22:10,574 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:10,575 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:10,575 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:10,575 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:10,575 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:10,575 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2019-10-22 11:22:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:22:10,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:10,601 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:22:10,604 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION]=== [2019-10-22 11:22:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash 28738657, now seen corresponding path program 1 times [2019-10-22 11:22:10,620 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:10,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1678680498] [2019-10-22 11:22:10,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_37f005ef-4a61-44dc-acf8-542ad4331b94/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:10,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:10,876 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort FloatRoundingMode not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:22:10,881 INFO L168 Benchmark]: Toolchain (without parser) took 1994.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:10,882 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:10,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:10,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.76 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:10,885 INFO L168 Benchmark]: Boogie Preprocessor took 73.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:10,886 INFO L168 Benchmark]: RCFGBuilder took 873.43 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:10,886 INFO L168 Benchmark]: TraceAbstraction took 368.76 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:10,890 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.76 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.96 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 873.43 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 368.76 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort FloatRoundingMode not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...