./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019-1.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_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/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 4494187e77773a0836e533a199cc56d858d4efc9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:20:56,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:20:56,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:20:56,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:20:56,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:20:56,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:20:56,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:20:56,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:20:56,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:20:56,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:20:56,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:20:56,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:20:56,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:20:56,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:20:56,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:20:56,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:20:56,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:20:56,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:20:56,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:20:56,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:20:56,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:20:56,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:20:56,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:20:56,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:20:56,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:20:56,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:20:56,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:20:56,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:20:56,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:20:56,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:20:56,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:20:56,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:20:56,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:20:56,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:20:56,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:20:56,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:20:56,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:20:56,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:20:56,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:20:56,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:20:56,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:20:56,462 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:20:56,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:20:56,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:20:56,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:20:56,474 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:20:56,474 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:20:56,475 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:20:56,475 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:20:56,475 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:20:56,475 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:20:56,475 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:20:56,475 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:20:56,476 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:20:56,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:20:56,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:20:56,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:20:56,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:20:56,477 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:20:56,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:20:56,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:20:56,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:20:56,477 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:20:56,478 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:20:56,478 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:20:56,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:20:56,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:20:56,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:20:56,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:20:56,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:20:56,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:20:56,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:56,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:20:56,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:20:56,479 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:20:56,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:20:56,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:20:56,480 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_5e927c1b-4d65-4c85-b921-d77c3781bb09/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 -> 4494187e77773a0836e533a199cc56d858d4efc9 [2019-10-22 11:20:56,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:20:56,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:20:56,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:20:56,520 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:20:56,520 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:20:56,521 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0019-1.i [2019-10-22 11:20:56,567 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/data/9e413d550/096d35a668f14a05b0cfb2ff6228a1d1/FLAGd264fbbbd [2019-10-22 11:20:56,999 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:20:56,999 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/sv-benchmarks/c/memsafety/test-0019-1.i [2019-10-22 11:20:57,010 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/data/9e413d550/096d35a668f14a05b0cfb2ff6228a1d1/FLAGd264fbbbd [2019-10-22 11:20:57,348 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/data/9e413d550/096d35a668f14a05b0cfb2ff6228a1d1 [2019-10-22 11:20:57,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:20:57,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:20:57,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:57,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:20:57,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:20:57,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d8eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,366 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:20:57,407 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:20:57,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:57,802 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:20:57,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:57,897 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:20:57,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57 WrapperNode [2019-10-22 11:20:57,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:57,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:57,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:20:57,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:20:57,907 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:20:57" (1/1) ... [2019-10-22 11:20:57,921 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:20:57" (1/1) ... [2019-10-22 11:20:57,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:57,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:20:57,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:20:57,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:20:57,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:20:57,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:20:57,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:20:57,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:20:57,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/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:20:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:20:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:20:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:20:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:20:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:20:58,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:20:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:20:58,309 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:20:58,309 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:20:58,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:58 BoogieIcfgContainer [2019-10-22 11:20:58,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:20:58,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:20:58,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:20:58,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:20:58,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:20:57" (1/3) ... [2019-10-22 11:20:58,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea5087d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:58, skipping insertion in model container [2019-10-22 11:20:58,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (2/3) ... [2019-10-22 11:20:58,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea5087d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:58, skipping insertion in model container [2019-10-22 11:20:58,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:58" (3/3) ... [2019-10-22 11:20:58,329 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2019-10-22 11:20:58,337 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:20:58,357 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-10-22 11:20:58,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-10-22 11:20:58,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:20:58,390 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:20:58,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:20:58,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:20:58,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:20:58,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:20:58,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:20:58,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:20:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-10-22 11:20:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:20:58,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:20:58,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:20:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:20:58,430 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890313413] [2019-10-22 11:20:58,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,602 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:20:58,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890313413] [2019-10-22 11:20:58,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:58,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62511450] [2019-10-22 11:20:58,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,620 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-10-22 11:20:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,698 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-10-22 11:20:58,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:20:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,708 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:20:58,709 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 11:20:58,710 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:20:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 11:20:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-22 11:20:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:20:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-10-22 11:20:58,742 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 3 [2019-10-22 11:20:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,742 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-10-22 11:20:58,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-10-22 11:20:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:20:58,743 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,743 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:20:58,743 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:20:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:20:58,744 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093184794] [2019-10-22 11:20:58,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,789 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:20:58,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093184794] [2019-10-22 11:20:58,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:58,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090359425] [2019-10-22 11:20:58,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,792 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 3 states. [2019-10-22 11:20:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,827 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-10-22 11:20:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:20:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,828 INFO L225 Difference]: With dead ends: 43 [2019-10-22 11:20:58,829 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:20:58,829 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:20:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:20:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 11:20:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:20:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-10-22 11:20:58,833 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 3 [2019-10-22 11:20:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,834 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-10-22 11:20:58,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-10-22 11:20:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:20:58,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:20:58,835 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:20:58,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2019-10-22 11:20:58,835 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141302424] [2019-10-22 11:20:58,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,955 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:20:58,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141302424] [2019-10-22 11:20:58,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:58,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289764672] [2019-10-22 11:20:58,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:58,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:58,958 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 5 states. [2019-10-22 11:20:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,023 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-10-22 11:20:59,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:20:59,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-10-22 11:20:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,024 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:20:59,024 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:20:59,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:20:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-22 11:20:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:20:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-10-22 11:20:59,029 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 5 [2019-10-22 11:20:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,029 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-10-22 11:20:59,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-10-22 11:20:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:20:59,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,030 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:20:59,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash 889446091, now seen corresponding path program 1 times [2019-10-22 11:20:59,031 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270228578] [2019-10-22 11:20:59,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,106 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:20:59,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270228578] [2019-10-22 11:20:59,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:59,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446358348] [2019-10-22 11:20:59,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:20:59,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:20:59,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:59,109 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 4 states. [2019-10-22 11:20:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,180 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-10-22 11:20:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:20:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,181 INFO L225 Difference]: With dead ends: 40 [2019-10-22 11:20:59,181 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:20:59,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:20:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 11:20:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:20:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-10-22 11:20:59,186 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 6 [2019-10-22 11:20:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,187 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-10-22 11:20:59,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:20:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-10-22 11:20:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:20:59,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,187 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,188 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:20:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash 889446092, now seen corresponding path program 1 times [2019-10-22 11:20:59,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274970966] [2019-10-22 11:20:59,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,280 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:20:59,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274970966] [2019-10-22 11:20:59,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:59,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710120986] [2019-10-22 11:20:59,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:20:59,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:20:59,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:59,282 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2019-10-22 11:20:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,327 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-10-22 11:20:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-10-22 11:20:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,328 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:20:59,328 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:20:59,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:20:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:20:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-22 11:20:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:20:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-10-22 11:20:59,334 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 6 [2019-10-22 11:20:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,334 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-10-22 11:20:59,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:20:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-10-22 11:20:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:20:59,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:20:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1835232166, now seen corresponding path program 1 times [2019-10-22 11:20:59,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484034937] [2019-10-22 11:20:59,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,402 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:20:59,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484034937] [2019-10-22 11:20:59,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:59,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836250459] [2019-10-22 11:20:59,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,404 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 3 states. [2019-10-22 11:20:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,453 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-10-22 11:20:59,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 11:20:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,454 INFO L225 Difference]: With dead ends: 34 [2019-10-22 11:20:59,454 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:20:59,454 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:20:59,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:20:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:20:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:20:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-10-22 11:20:59,457 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 9 [2019-10-22 11:20:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,457 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-10-22 11:20:59,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-10-22 11:20:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:20:59,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,458 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,458 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:20:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1835232167, now seen corresponding path program 1 times [2019-10-22 11:20:59,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262326303] [2019-10-22 11:20:59,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,520 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:20:59,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262326303] [2019-10-22 11:20:59,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:20:59,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68421918] [2019-10-22 11:20:59,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,522 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 3 states. [2019-10-22 11:20:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,549 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-10-22 11:20:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 11:20:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,550 INFO L225 Difference]: With dead ends: 30 [2019-10-22 11:20:59,550 INFO L226 Difference]: Without dead ends: 30 [2019-10-22 11:20:59,551 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:20:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-22 11:20:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 11:20:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:20:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-10-22 11:20:59,553 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 9 [2019-10-22 11:20:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,553 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-10-22 11:20:59,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-10-22 11:20:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:20:59,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,557 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:20:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash -528418345, now seen corresponding path program 1 times [2019-10-22 11:20:59,557 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144492230] [2019-10-22 11:20:59,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,756 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:20:59,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144492230] [2019-10-22 11:20:59,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:20:59,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039911883] [2019-10-22 11:20:59,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:20:59,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:20:59,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:20:59,758 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2019-10-22 11:21:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:00,051 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-10-22 11:21:00,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:21:00,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-10-22 11:21:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:00,053 INFO L225 Difference]: With dead ends: 29 [2019-10-22 11:21:00,053 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 11:21:00,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:21:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 11:21:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 11:21:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 11:21:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-10-22 11:21:00,056 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2019-10-22 11:21:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:00,057 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-10-22 11:21:00,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-10-22 11:21:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:21:00,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:00,058 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:00,058 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:21:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash 798899022, now seen corresponding path program 1 times [2019-10-22 11:21:00,059 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:00,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734068995] [2019-10-22 11:21:00,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:00,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:00,466 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:00,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734068995] [2019-10-22 11:21:00,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:00,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 11:21:00,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10797267] [2019-10-22 11:21:00,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:21:00,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:00,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:21:00,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:00,468 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2019-10-22 11:21:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:01,128 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2019-10-22 11:21:01,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:21:01,128 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-10-22 11:21:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:01,129 INFO L225 Difference]: With dead ends: 29 [2019-10-22 11:21:01,129 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 11:21:01,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2019-10-22 11:21:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 11:21:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 11:21:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 11:21:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2019-10-22 11:21:01,133 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 17 [2019-10-22 11:21:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:01,133 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2019-10-22 11:21:01,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:21:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2019-10-22 11:21:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:21:01,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:01,134 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:01,134 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:21:01,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:01,135 INFO L82 PathProgramCache]: Analyzing trace with hash 798900559, now seen corresponding path program 1 times [2019-10-22 11:21:01,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:01,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720701591] [2019-10-22 11:21:01,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:01,269 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:01,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720701591] [2019-10-22 11:21:01,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:01,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:01,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977322652] [2019-10-22 11:21:01,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:01,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:01,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:01,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:01,271 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand 10 states. [2019-10-22 11:21:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:01,460 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2019-10-22 11:21:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:21:01,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-10-22 11:21:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:01,460 INFO L225 Difference]: With dead ends: 28 [2019-10-22 11:21:01,460 INFO L226 Difference]: Without dead ends: 28 [2019-10-22 11:21:01,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:21:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-22 11:21:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-22 11:21:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 11:21:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2019-10-22 11:21:01,463 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 17 [2019-10-22 11:21:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:01,463 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2019-10-22 11:21:01,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2019-10-22 11:21:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:01,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:01,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:01,464 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:21:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1003886375, now seen corresponding path program 1 times [2019-10-22 11:21:01,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:01,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211306972] [2019-10-22 11:21:01,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:01,618 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:01,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211306972] [2019-10-22 11:21:01,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:01,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:01,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339687914] [2019-10-22 11:21:01,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:01,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:01,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:01,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:01,620 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 10 states. [2019-10-22 11:21:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:01,853 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-10-22 11:21:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:21:01,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-10-22 11:21:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:01,854 INFO L225 Difference]: With dead ends: 27 [2019-10-22 11:21:01,854 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 11:21:01,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:21:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 11:21:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 11:21:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 11:21:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-10-22 11:21:01,857 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 18 [2019-10-22 11:21:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:01,857 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-10-22 11:21:01,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-10-22 11:21:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:21:01,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:01,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:01,858 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:21:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1055706479, now seen corresponding path program 1 times [2019-10-22 11:21:01,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:01,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397692636] [2019-10-22 11:21:01,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:02,046 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:02,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397692636] [2019-10-22 11:21:02,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:02,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:02,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985075270] [2019-10-22 11:21:02,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:02,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:02,047 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 10 states. [2019-10-22 11:21:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:02,269 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-10-22 11:21:02,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:21:02,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-22 11:21:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:02,269 INFO L225 Difference]: With dead ends: 26 [2019-10-22 11:21:02,269 INFO L226 Difference]: Without dead ends: 26 [2019-10-22 11:21:02,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:21:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-22 11:21:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-22 11:21:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 11:21:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2019-10-22 11:21:02,271 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 19 [2019-10-22 11:21:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:02,275 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2019-10-22 11:21:02,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2019-10-22 11:21:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:21:02,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:02,275 INFO L380 BasicCegarLoop]: trace histogram [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:02,276 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:21:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:02,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1632837595, now seen corresponding path program 1 times [2019-10-22 11:21:02,276 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:02,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840777888] [2019-10-22 11:21:02,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:02,453 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:02,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840777888] [2019-10-22 11:21:02,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:02,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:02,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798826060] [2019-10-22 11:21:02,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:02,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:02,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:02,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:02,455 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 10 states. [2019-10-22 11:21:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:02,661 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2019-10-22 11:21:02,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:21:02,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-10-22 11:21:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:02,661 INFO L225 Difference]: With dead ends: 25 [2019-10-22 11:21:02,661 INFO L226 Difference]: Without dead ends: 25 [2019-10-22 11:21:02,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:21:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-22 11:21:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-22 11:21:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 11:21:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2019-10-22 11:21:02,663 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 20 [2019-10-22 11:21:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:02,663 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2019-10-22 11:21:02,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2019-10-22 11:21:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:21:02,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:02,663 INFO L380 BasicCegarLoop]: trace histogram [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:02,664 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:21:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash -921642029, now seen corresponding path program 1 times [2019-10-22 11:21:02,664 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:02,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329022018] [2019-10-22 11:21:02,664 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,664 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:02,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:02,913 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:02,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329022018] [2019-10-22 11:21:02,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:02,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:21:02,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252755456] [2019-10-22 11:21:02,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:21:02,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:02,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:21:02,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:02,915 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 15 states. [2019-10-22 11:21:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:03,384 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-10-22 11:21:03,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:21:03,384 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-10-22 11:21:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:03,385 INFO L225 Difference]: With dead ends: 24 [2019-10-22 11:21:03,385 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:21:03,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-10-22 11:21:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:21:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 11:21:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:21:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2019-10-22 11:21:03,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 21 [2019-10-22 11:21:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:03,387 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2019-10-22 11:21:03,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:21:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2019-10-22 11:21:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:03,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:03,387 INFO L380 BasicCegarLoop]: trace histogram [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:03,388 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2019-10-22 11:21:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:03,388 INFO L82 PathProgramCache]: Analyzing trace with hash -934724330, now seen corresponding path program 1 times [2019-10-22 11:21:03,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:03,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175436509] [2019-10-22 11:21:03,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,910 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-10-22 11:21:05,349 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:05,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175436509] [2019-10-22 11:21:05,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-22 11:21:05,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640305525] [2019-10-22 11:21:05,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-22 11:21:05,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:05,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-22 11:21:05,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:21:05,351 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 22 states. [2019-10-22 11:21:05,845 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-22 11:21:06,122 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-22 11:21:06,391 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-22 11:21:06,579 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-10-22 11:21:06,800 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-10-22 11:21:07,143 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-10-22 11:21:07,502 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-10-22 11:21:07,940 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 114 [2019-10-22 11:21:08,331 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2019-10-22 11:21:08,782 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 112 [2019-10-22 11:21:09,161 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2019-10-22 11:21:09,469 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2019-10-22 11:21:09,823 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-10-22 11:21:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:09,847 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-10-22 11:21:09,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-22 11:21:09,847 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-10-22 11:21:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:09,847 INFO L225 Difference]: With dead ends: 23 [2019-10-22 11:21:09,847 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:09,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2019-10-22 11:21:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:09,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-22 11:21:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:09,849 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:09,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-22 11:21:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:09,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:09,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:09 BoogieIcfgContainer [2019-10-22 11:21:09,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:09,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:09,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:09,854 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:09,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:58" (3/4) ... [2019-10-22 11:21:09,858 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:21:09,871 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-10-22 11:21:09,871 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-10-22 11:21:09,872 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:21:09,912 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5e927c1b-4d65-4c85-b921-d77c3781bb09/bin/utaipan/witness.graphml [2019-10-22 11:21:09,912 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:09,913 INFO L168 Benchmark]: Toolchain (without parser) took 12561.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.2 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 157.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:09,914 INFO L168 Benchmark]: CDTParser took 0.18 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:21:09,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:09,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.14 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:21:09,914 INFO L168 Benchmark]: Boogie Preprocessor took 23.62 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:21:09,915 INFO L168 Benchmark]: RCFGBuilder took 346.06 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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:09,915 INFO L168 Benchmark]: TraceAbstraction took 11543.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.4 MB). Peak memory consumption was 164.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:09,915 INFO L168 Benchmark]: Witness Printer took 58.24 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:09,920 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.62 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 346.06 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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11543.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.4 MB). Peak memory consumption was 164.2 MB. Max. memory is 11.5 GB. * Witness Printer took 58.24 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 530]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 23 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 237 SDtfs, 702 SDslu, 291 SDs, 0 SdLazy, 1319 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 47498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...