./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0214.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_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0214.i -s /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/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 bbad5595d4a380534920239c65f21022d7390d8a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0214.i -s /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/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 bbad5595d4a380534920239c65f21022d7390d8a ....................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:16,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:16,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:16,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:16,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:16,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:16,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:16,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:16,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:16,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:16,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:16,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:16,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:16,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:16,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:16,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:16,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:16,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:16,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:16,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:16,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:16,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:16,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:16,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:16,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:16,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:16,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:16,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:16,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:16,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:16,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:16,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:16,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:16,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:16,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:16,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:16,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:16,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:16,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:16,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:16,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:16,344 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:26:16,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:16,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:16,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:16,359 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:16,360 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:16,360 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:16,360 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:16,360 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:16,360 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:16,360 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:16,361 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:16,361 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:16,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:26:16,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:26:16,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:16,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:16,363 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:26:16,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:16,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:16,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:16,363 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:26:16,363 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:26:16,364 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:26:16,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:16,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:16,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:16,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:16,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:16,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:16,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:16,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:16,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:16,365 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:16,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:16,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:16,366 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_33db0c0b-da44-4db0-97ce-d0ed6f43b394/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 -> bbad5595d4a380534920239c65f21022d7390d8a [2019-10-22 11:26:16,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:16,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:16,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:16,422 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:16,423 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:16,423 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0214.i [2019-10-22 11:26:16,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data/5466b588a/21e71f4a5743438faf41e3b9ab30eae8/FLAGc6abbfa54 [2019-10-22 11:26:16,960 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:16,961 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/sv-benchmarks/c/memsafety/test-0214.i [2019-10-22 11:26:16,973 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data/5466b588a/21e71f4a5743438faf41e3b9ab30eae8/FLAGc6abbfa54 [2019-10-22 11:26:17,236 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data/5466b588a/21e71f4a5743438faf41e3b9ab30eae8 [2019-10-22 11:26:17,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:17,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:17,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:17,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:17,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:17,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1ed930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17, skipping insertion in model container [2019-10-22 11:26:17,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,269 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:17,319 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:17,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:17,767 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:17,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:17,881 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:17,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17 WrapperNode [2019-10-22 11:26:17,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:17,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:17,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:17,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:17,891 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:26:17" (1/1) ... [2019-10-22 11:26:17,908 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:26:17" (1/1) ... [2019-10-22 11:26:17,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:17,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:17,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:17,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:17,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (1/1) ... [2019-10-22 11:26:17,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:17,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:17,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:17,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:17,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/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:26:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:26:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:26:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:18,730 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:18,731 INFO L284 CfgBuilder]: Removed 22 assume(true) statements. [2019-10-22 11:26:18,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:18 BoogieIcfgContainer [2019-10-22 11:26:18,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:18,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:18,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:18,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:18,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:17" (1/3) ... [2019-10-22 11:26:18,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697b2da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:18, skipping insertion in model container [2019-10-22 11:26:18,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:17" (2/3) ... [2019-10-22 11:26:18,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697b2da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:18, skipping insertion in model container [2019-10-22 11:26:18,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:18" (3/3) ... [2019-10-22 11:26:18,741 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0214.i [2019-10-22 11:26:18,751 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:18,759 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-10-22 11:26:18,770 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-10-22 11:26:18,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:18,791 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:26:18,791 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:18,791 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:18,791 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:18,791 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:18,791 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:18,792 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-10-22 11:26:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:26:18,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:18,819 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:26:18,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash 896186858, now seen corresponding path program 1 times [2019-10-22 11:26:18,836 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:18,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663475083] [2019-10-22 11:26:18,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:18,968 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:26:18,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663475083] [2019-10-22 11:26:18,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:18,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:18,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357868181] [2019-10-22 11:26:18,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:26:18,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:26:18,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:26:19,000 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 2 states. [2019-10-22 11:26:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:19,022 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2019-10-22 11:26:19,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:26:19,024 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:26:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:19,040 INFO L225 Difference]: With dead ends: 142 [2019-10-22 11:26:19,040 INFO L226 Difference]: Without dead ends: 140 [2019-10-22 11:26:19,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:26:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-22 11:26:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-10-22 11:26:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 11:26:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2019-10-22 11:26:19,100 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 6 [2019-10-22 11:26:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:19,101 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2019-10-22 11:26:19,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:26:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2019-10-22 11:26:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:26:19,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:19,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:19,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:19,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:19,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1807053727, now seen corresponding path program 1 times [2019-10-22 11:26:19,103 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:19,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146592446] [2019-10-22 11:26:19,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:19,179 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:26:19,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146592446] [2019-10-22 11:26:19,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:19,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 11:26:19,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10053272] [2019-10-22 11:26:19,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:19,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:19,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:19,183 INFO L87 Difference]: Start difference. First operand 140 states and 157 transitions. Second operand 3 states. [2019-10-22 11:26:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:19,413 INFO L93 Difference]: Finished difference Result 270 states and 303 transitions. [2019-10-22 11:26:19,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:19,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-22 11:26:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:19,417 INFO L225 Difference]: With dead ends: 270 [2019-10-22 11:26:19,417 INFO L226 Difference]: Without dead ends: 270 [2019-10-22 11:26:19,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:26:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-22 11:26:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 185. [2019-10-22 11:26:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-22 11:26:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 240 transitions. [2019-10-22 11:26:19,436 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 240 transitions. Word has length 7 [2019-10-22 11:26:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:19,440 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 240 transitions. [2019-10-22 11:26:19,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 240 transitions. [2019-10-22 11:26:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:26:19,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:19,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:19,442 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1807053728, now seen corresponding path program 1 times [2019-10-22 11:26:19,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:19,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923113859] [2019-10-22 11:26:19,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:19,555 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:26:19,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923113859] [2019-10-22 11:26:19,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:19,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:19,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704171997] [2019-10-22 11:26:19,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:19,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:19,557 INFO L87 Difference]: Start difference. First operand 185 states and 240 transitions. Second operand 4 states. [2019-10-22 11:26:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:19,768 INFO L93 Difference]: Finished difference Result 326 states and 408 transitions. [2019-10-22 11:26:19,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:19,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:26:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:19,770 INFO L225 Difference]: With dead ends: 326 [2019-10-22 11:26:19,770 INFO L226 Difference]: Without dead ends: 326 [2019-10-22 11:26:19,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-22 11:26:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 252. [2019-10-22 11:26:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:26:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 359 transitions. [2019-10-22 11:26:19,786 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 359 transitions. Word has length 7 [2019-10-22 11:26:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:19,786 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 359 transitions. [2019-10-22 11:26:19,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 359 transitions. [2019-10-22 11:26:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:26:19,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:19,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:19,787 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:19,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:19,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1807053790, now seen corresponding path program 1 times [2019-10-22 11:26:19,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:19,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417324707] [2019-10-22 11:26:19,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:19,872 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:26:19,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417324707] [2019-10-22 11:26:19,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:19,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:19,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933852100] [2019-10-22 11:26:19,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:19,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:19,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:19,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:19,875 INFO L87 Difference]: Start difference. First operand 252 states and 359 transitions. Second operand 4 states. [2019-10-22 11:26:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,084 INFO L93 Difference]: Finished difference Result 325 states and 406 transitions. [2019-10-22 11:26:20,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:20,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:26:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,086 INFO L225 Difference]: With dead ends: 325 [2019-10-22 11:26:20,086 INFO L226 Difference]: Without dead ends: 325 [2019-10-22 11:26:20,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-22 11:26:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 252. [2019-10-22 11:26:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:26:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 359 transitions. [2019-10-22 11:26:20,104 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 359 transitions. Word has length 7 [2019-10-22 11:26:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,104 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 359 transitions. [2019-10-22 11:26:20,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 359 transitions. [2019-10-22 11:26:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:26:20,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,106 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1271628367, now seen corresponding path program 1 times [2019-10-22 11:26:20,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370424952] [2019-10-22 11:26:20,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,224 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:26:20,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370424952] [2019-10-22 11:26:20,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294152619] [2019-10-22 11:26:20,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:20,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:20,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:20,227 INFO L87 Difference]: Start difference. First operand 252 states and 359 transitions. Second operand 5 states. [2019-10-22 11:26:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,593 INFO L93 Difference]: Finished difference Result 424 states and 526 transitions. [2019-10-22 11:26:20,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:20,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-10-22 11:26:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,595 INFO L225 Difference]: With dead ends: 424 [2019-10-22 11:26:20,595 INFO L226 Difference]: Without dead ends: 424 [2019-10-22 11:26:20,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-22 11:26:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 258. [2019-10-22 11:26:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-22 11:26:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 369 transitions. [2019-10-22 11:26:20,609 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 369 transitions. Word has length 9 [2019-10-22 11:26:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,610 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 369 transitions. [2019-10-22 11:26:20,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 369 transitions. [2019-10-22 11:26:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:26:20,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,610 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,611 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1271628366, now seen corresponding path program 1 times [2019-10-22 11:26:20,611 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022479158] [2019-10-22 11:26:20,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,666 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:26:20,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022479158] [2019-10-22 11:26:20,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:20,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498159081] [2019-10-22 11:26:20,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:20,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:20,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:20,669 INFO L87 Difference]: Start difference. First operand 258 states and 369 transitions. Second operand 4 states. [2019-10-22 11:26:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,943 INFO L93 Difference]: Finished difference Result 472 states and 570 transitions. [2019-10-22 11:26:20,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:20,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:26:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,945 INFO L225 Difference]: With dead ends: 472 [2019-10-22 11:26:20,945 INFO L226 Difference]: Without dead ends: 472 [2019-10-22 11:26:20,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-22 11:26:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 253. [2019-10-22 11:26:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-22 11:26:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 357 transitions. [2019-10-22 11:26:20,951 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 357 transitions. Word has length 9 [2019-10-22 11:26:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,952 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 357 transitions. [2019-10-22 11:26:20,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 357 transitions. [2019-10-22 11:26:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:26:20,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,952 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,953 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1271630289, now seen corresponding path program 1 times [2019-10-22 11:26:20,958 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245550407] [2019-10-22 11:26:20,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,036 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:26:21,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245550407] [2019-10-22 11:26:21,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:21,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135781219] [2019-10-22 11:26:21,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:21,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:21,038 INFO L87 Difference]: Start difference. First operand 253 states and 357 transitions. Second operand 5 states. [2019-10-22 11:26:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,329 INFO L93 Difference]: Finished difference Result 418 states and 511 transitions. [2019-10-22 11:26:21,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:21,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-10-22 11:26:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,330 INFO L225 Difference]: With dead ends: 418 [2019-10-22 11:26:21,331 INFO L226 Difference]: Without dead ends: 418 [2019-10-22 11:26:21,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-22 11:26:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 253. [2019-10-22 11:26:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-22 11:26:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 357 transitions. [2019-10-22 11:26:21,339 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 357 transitions. Word has length 9 [2019-10-22 11:26:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,339 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 357 transitions. [2019-10-22 11:26:21,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 357 transitions. [2019-10-22 11:26:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:26:21,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,340 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:21,340 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 817695854, now seen corresponding path program 1 times [2019-10-22 11:26:21,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132576487] [2019-10-22 11:26:21,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,488 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:26:21,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132576487] [2019-10-22 11:26:21,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:21,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929223856] [2019-10-22 11:26:21,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:21,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:21,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:21,489 INFO L87 Difference]: Start difference. First operand 253 states and 357 transitions. Second operand 6 states. [2019-10-22 11:26:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,721 INFO L93 Difference]: Finished difference Result 367 states and 488 transitions. [2019-10-22 11:26:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:21,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-10-22 11:26:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,722 INFO L225 Difference]: With dead ends: 367 [2019-10-22 11:26:21,722 INFO L226 Difference]: Without dead ends: 367 [2019-10-22 11:26:21,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-22 11:26:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 290. [2019-10-22 11:26:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-22 11:26:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 422 transitions. [2019-10-22 11:26:21,728 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 422 transitions. Word has length 10 [2019-10-22 11:26:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,728 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 422 transitions. [2019-10-22 11:26:21,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 422 transitions. [2019-10-22 11:26:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:26:21,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,729 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:21,729 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash 819542896, now seen corresponding path program 1 times [2019-10-22 11:26:21,730 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614367755] [2019-10-22 11:26:21,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,826 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:26:21,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614367755] [2019-10-22 11:26:21,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:21,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248485924] [2019-10-22 11:26:21,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:21,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:21,827 INFO L87 Difference]: Start difference. First operand 290 states and 422 transitions. Second operand 6 states. [2019-10-22 11:26:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,994 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2019-10-22 11:26:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:21,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-10-22 11:26:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,996 INFO L225 Difference]: With dead ends: 357 [2019-10-22 11:26:21,996 INFO L226 Difference]: Without dead ends: 357 [2019-10-22 11:26:21,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-10-22 11:26:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 289. [2019-10-22 11:26:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-22 11:26:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 421 transitions. [2019-10-22 11:26:22,005 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 421 transitions. Word has length 10 [2019-10-22 11:26:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:22,005 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 421 transitions. [2019-10-22 11:26:22,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 421 transitions. [2019-10-22 11:26:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:26:22,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:22,006 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:22,006 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:22,007 INFO L82 PathProgramCache]: Analyzing trace with hash -421233593, now seen corresponding path program 1 times [2019-10-22 11:26:22,007 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:22,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143948192] [2019-10-22 11:26:22,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:22,030 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:26:22,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143948192] [2019-10-22 11:26:22,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:22,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:22,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667789102] [2019-10-22 11:26:22,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:22,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:22,032 INFO L87 Difference]: Start difference. First operand 289 states and 421 transitions. Second operand 3 states. [2019-10-22 11:26:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:22,115 INFO L93 Difference]: Finished difference Result 344 states and 474 transitions. [2019-10-22 11:26:22,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:22,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 11:26:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:22,117 INFO L225 Difference]: With dead ends: 344 [2019-10-22 11:26:22,117 INFO L226 Difference]: Without dead ends: 337 [2019-10-22 11:26:22,117 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:26:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-22 11:26:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 286. [2019-10-22 11:26:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-22 11:26:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 416 transitions. [2019-10-22 11:26:22,122 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 416 transitions. Word has length 11 [2019-10-22 11:26:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:22,122 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 416 transitions. [2019-10-22 11:26:22,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2019-10-22 11:26:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:26:22,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:22,123 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:22,123 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2007883417, now seen corresponding path program 1 times [2019-10-22 11:26:22,124 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:22,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586412255] [2019-10-22 11:26:22,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:22,160 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:26:22,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586412255] [2019-10-22 11:26:22,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:22,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:22,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439191010] [2019-10-22 11:26:22,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:22,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:22,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:22,162 INFO L87 Difference]: Start difference. First operand 286 states and 416 transitions. Second operand 4 states. [2019-10-22 11:26:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:22,424 INFO L93 Difference]: Finished difference Result 619 states and 831 transitions. [2019-10-22 11:26:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:22,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:26:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:22,426 INFO L225 Difference]: With dead ends: 619 [2019-10-22 11:26:22,427 INFO L226 Difference]: Without dead ends: 619 [2019-10-22 11:26:22,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-22 11:26:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 284. [2019-10-22 11:26:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-22 11:26:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 406 transitions. [2019-10-22 11:26:22,436 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 406 transitions. Word has length 11 [2019-10-22 11:26:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:22,436 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 406 transitions. [2019-10-22 11:26:22,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 406 transitions. [2019-10-22 11:26:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:26:22,437 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:22,437 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:22,437 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2007883416, now seen corresponding path program 1 times [2019-10-22 11:26:22,438 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:22,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535979957] [2019-10-22 11:26:22,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:22,488 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:26:22,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535979957] [2019-10-22 11:26:22,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:22,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:22,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092345642] [2019-10-22 11:26:22,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:22,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:22,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:22,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:22,490 INFO L87 Difference]: Start difference. First operand 284 states and 406 transitions. Second operand 4 states. [2019-10-22 11:26:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:22,660 INFO L93 Difference]: Finished difference Result 339 states and 431 transitions. [2019-10-22 11:26:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:22,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:26:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:22,661 INFO L225 Difference]: With dead ends: 339 [2019-10-22 11:26:22,662 INFO L226 Difference]: Without dead ends: 339 [2019-10-22 11:26:22,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-10-22 11:26:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 284. [2019-10-22 11:26:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-22 11:26:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 398 transitions. [2019-10-22 11:26:22,668 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 398 transitions. Word has length 11 [2019-10-22 11:26:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:22,669 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 398 transitions. [2019-10-22 11:26:22,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 398 transitions. [2019-10-22 11:26:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:26:22,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:22,669 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:22,670 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash 358356215, now seen corresponding path program 1 times [2019-10-22 11:26:22,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:22,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600108217] [2019-10-22 11:26:22,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:22,712 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:26:22,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600108217] [2019-10-22 11:26:22,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:22,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:22,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946843654] [2019-10-22 11:26:22,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:22,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:22,714 INFO L87 Difference]: Start difference. First operand 284 states and 398 transitions. Second operand 3 states. [2019-10-22 11:26:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:22,836 INFO L93 Difference]: Finished difference Result 373 states and 495 transitions. [2019-10-22 11:26:22,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:22,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:26:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:22,838 INFO L225 Difference]: With dead ends: 373 [2019-10-22 11:26:22,838 INFO L226 Difference]: Without dead ends: 373 [2019-10-22 11:26:22,838 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:26:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-10-22 11:26:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 281. [2019-10-22 11:26:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-22 11:26:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 392 transitions. [2019-10-22 11:26:22,844 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 392 transitions. Word has length 15 [2019-10-22 11:26:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:22,845 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 392 transitions. [2019-10-22 11:26:22,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 392 transitions. [2019-10-22 11:26:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:26:22,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:22,848 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:22,848 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash 358356216, now seen corresponding path program 1 times [2019-10-22 11:26:22,849 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:22,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975419164] [2019-10-22 11:26:22,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:22,919 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:26:22,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975419164] [2019-10-22 11:26:22,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:22,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:22,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389151510] [2019-10-22 11:26:22,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:22,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:22,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:22,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:22,920 INFO L87 Difference]: Start difference. First operand 281 states and 392 transitions. Second operand 4 states. [2019-10-22 11:26:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,091 INFO L93 Difference]: Finished difference Result 486 states and 608 transitions. [2019-10-22 11:26:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:23,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 11:26:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,094 INFO L225 Difference]: With dead ends: 486 [2019-10-22 11:26:23,094 INFO L226 Difference]: Without dead ends: 486 [2019-10-22 11:26:23,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 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:26:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-10-22 11:26:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 284. [2019-10-22 11:26:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-22 11:26:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 394 transitions. [2019-10-22 11:26:23,102 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 394 transitions. Word has length 15 [2019-10-22 11:26:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:23,105 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 394 transitions. [2019-10-22 11:26:23,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 394 transitions. [2019-10-22 11:26:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:23,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:23,106 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:26:23,106 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1775859196, now seen corresponding path program 1 times [2019-10-22 11:26:23,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:23,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905527393] [2019-10-22 11:26:23,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:23,168 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:26:23,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905527393] [2019-10-22 11:26:23,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:23,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:23,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847632845] [2019-10-22 11:26:23,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:23,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:23,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:23,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:23,170 INFO L87 Difference]: Start difference. First operand 284 states and 394 transitions. Second operand 4 states. [2019-10-22 11:26:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,333 INFO L93 Difference]: Finished difference Result 485 states and 606 transitions. [2019-10-22 11:26:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:23,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-22 11:26:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,335 INFO L225 Difference]: With dead ends: 485 [2019-10-22 11:26:23,335 INFO L226 Difference]: Without dead ends: 485 [2019-10-22 11:26:23,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 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:26:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-22 11:26:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 286. [2019-10-22 11:26:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-22 11:26:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 396 transitions. [2019-10-22 11:26:23,344 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 396 transitions. Word has length 16 [2019-10-22 11:26:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:23,344 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 396 transitions. [2019-10-22 11:26:23,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 396 transitions. [2019-10-22 11:26:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:23,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:23,347 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:26:23,347 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1775803492, now seen corresponding path program 1 times [2019-10-22 11:26:23,348 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:23,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367738406] [2019-10-22 11:26:23,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:23,414 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:26:23,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367738406] [2019-10-22 11:26:23,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:23,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:23,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950339620] [2019-10-22 11:26:23,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:23,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:23,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:23,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:23,416 INFO L87 Difference]: Start difference. First operand 286 states and 396 transitions. Second operand 6 states. [2019-10-22 11:26:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,513 INFO L93 Difference]: Finished difference Result 801 states and 1054 transitions. [2019-10-22 11:26:23,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:23,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:26:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,517 INFO L225 Difference]: With dead ends: 801 [2019-10-22 11:26:23,517 INFO L226 Difference]: Without dead ends: 801 [2019-10-22 11:26:23,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-10-22 11:26:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 304. [2019-10-22 11:26:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-22 11:26:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 420 transitions. [2019-10-22 11:26:23,527 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 420 transitions. Word has length 16 [2019-10-22 11:26:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:23,527 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 420 transitions. [2019-10-22 11:26:23,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 420 transitions. [2019-10-22 11:26:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:23,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:23,529 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:26:23,530 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1775801570, now seen corresponding path program 1 times [2019-10-22 11:26:23,530 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:23,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685802366] [2019-10-22 11:26:23,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:23,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:26:23,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685802366] [2019-10-22 11:26:23,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:23,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:23,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291095338] [2019-10-22 11:26:23,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:23,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:23,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:23,603 INFO L87 Difference]: Start difference. First operand 304 states and 420 transitions. Second operand 6 states. [2019-10-22 11:26:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,706 INFO L93 Difference]: Finished difference Result 791 states and 1040 transitions. [2019-10-22 11:26:23,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:23,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:26:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,709 INFO L225 Difference]: With dead ends: 791 [2019-10-22 11:26:23,709 INFO L226 Difference]: Without dead ends: 791 [2019-10-22 11:26:23,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-22 11:26:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 302. [2019-10-22 11:26:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-22 11:26:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 416 transitions. [2019-10-22 11:26:23,718 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 416 transitions. Word has length 16 [2019-10-22 11:26:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:23,719 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 416 transitions. [2019-10-22 11:26:23,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 416 transitions. [2019-10-22 11:26:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:23,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:23,719 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:26:23,720 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2126136794, now seen corresponding path program 1 times [2019-10-22 11:26:23,720 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:23,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863558018] [2019-10-22 11:26:23,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:23,766 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:26:23,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863558018] [2019-10-22 11:26:23,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:23,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:23,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999719112] [2019-10-22 11:26:23,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:23,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:23,767 INFO L87 Difference]: Start difference. First operand 302 states and 416 transitions. Second operand 4 states. [2019-10-22 11:26:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,963 INFO L93 Difference]: Finished difference Result 516 states and 645 transitions. [2019-10-22 11:26:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:23,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-22 11:26:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,966 INFO L225 Difference]: With dead ends: 516 [2019-10-22 11:26:23,966 INFO L226 Difference]: Without dead ends: 516 [2019-10-22 11:26:23,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 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:26:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-22 11:26:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 306. [2019-10-22 11:26:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-22 11:26:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 420 transitions. [2019-10-22 11:26:23,974 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 420 transitions. Word has length 16 [2019-10-22 11:26:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:23,974 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 420 transitions. [2019-10-22 11:26:23,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 420 transitions. [2019-10-22 11:26:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:23,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:23,975 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:26:23,976 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:23,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2126138716, now seen corresponding path program 1 times [2019-10-22 11:26:23,976 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:23,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218056485] [2019-10-22 11:26:23,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:24,049 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:26:24,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218056485] [2019-10-22 11:26:24,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:24,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:24,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418438319] [2019-10-22 11:26:24,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:24,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:24,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:24,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:24,050 INFO L87 Difference]: Start difference. First operand 306 states and 420 transitions. Second operand 6 states. [2019-10-22 11:26:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:24,148 INFO L93 Difference]: Finished difference Result 788 states and 1034 transitions. [2019-10-22 11:26:24,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:24,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:26:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:24,150 INFO L225 Difference]: With dead ends: 788 [2019-10-22 11:26:24,151 INFO L226 Difference]: Without dead ends: 788 [2019-10-22 11:26:24,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-22 11:26:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 301. [2019-10-22 11:26:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-22 11:26:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 412 transitions. [2019-10-22 11:26:24,159 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 412 transitions. Word has length 16 [2019-10-22 11:26:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:24,159 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 412 transitions. [2019-10-22 11:26:24,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 412 transitions. [2019-10-22 11:26:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:24,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:24,160 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:26:24,161 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash 548075563, now seen corresponding path program 1 times [2019-10-22 11:26:24,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:24,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963924139] [2019-10-22 11:26:24,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:24,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:24,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:24,507 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:26:24,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963924139] [2019-10-22 11:26:24,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:24,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:24,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929165097] [2019-10-22 11:26:24,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:24,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:24,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:24,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:24,508 INFO L87 Difference]: Start difference. First operand 301 states and 412 transitions. Second operand 9 states. [2019-10-22 11:26:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:25,066 INFO L93 Difference]: Finished difference Result 533 states and 682 transitions. [2019-10-22 11:26:25,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:25,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-10-22 11:26:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:25,069 INFO L225 Difference]: With dead ends: 533 [2019-10-22 11:26:25,069 INFO L226 Difference]: Without dead ends: 532 [2019-10-22 11:26:25,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:26:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-22 11:26:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 298. [2019-10-22 11:26:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 11:26:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 406 transitions. [2019-10-22 11:26:25,076 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 406 transitions. Word has length 17 [2019-10-22 11:26:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:25,076 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 406 transitions. [2019-10-22 11:26:25,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 406 transitions. [2019-10-22 11:26:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:25,076 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:25,076 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:26:25,077 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1485731170, now seen corresponding path program 1 times [2019-10-22 11:26:25,077 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:25,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945558294] [2019-10-22 11:26:25,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:25,127 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:26:25,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945558294] [2019-10-22 11:26:25,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:25,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:25,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776166721] [2019-10-22 11:26:25,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:25,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:25,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:25,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:25,129 INFO L87 Difference]: Start difference. First operand 298 states and 406 transitions. Second operand 4 states. [2019-10-22 11:26:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:25,294 INFO L93 Difference]: Finished difference Result 504 states and 625 transitions. [2019-10-22 11:26:25,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:25,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-22 11:26:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:25,295 INFO L225 Difference]: With dead ends: 504 [2019-10-22 11:26:25,295 INFO L226 Difference]: Without dead ends: 504 [2019-10-22 11:26:25,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 2 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:26:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-10-22 11:26:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 291. [2019-10-22 11:26:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-22 11:26:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 398 transitions. [2019-10-22 11:26:25,300 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 398 transitions. Word has length 17 [2019-10-22 11:26:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:25,300 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 398 transitions. [2019-10-22 11:26:25,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 398 transitions. [2019-10-22 11:26:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:25,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:25,301 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:26:25,301 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1572721450, now seen corresponding path program 1 times [2019-10-22 11:26:25,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:25,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127882767] [2019-10-22 11:26:25,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:25,327 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:26:25,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127882767] [2019-10-22 11:26:25,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:25,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:25,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252860008] [2019-10-22 11:26:25,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:25,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:25,329 INFO L87 Difference]: Start difference. First operand 291 states and 398 transitions. Second operand 4 states. [2019-10-22 11:26:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:25,480 INFO L93 Difference]: Finished difference Result 451 states and 577 transitions. [2019-10-22 11:26:25,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:25,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-22 11:26:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:25,483 INFO L225 Difference]: With dead ends: 451 [2019-10-22 11:26:25,483 INFO L226 Difference]: Without dead ends: 451 [2019-10-22 11:26:25,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-22 11:26:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 289. [2019-10-22 11:26:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-22 11:26:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 392 transitions. [2019-10-22 11:26:25,490 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 392 transitions. Word has length 19 [2019-10-22 11:26:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:25,491 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 392 transitions. [2019-10-22 11:26:25,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 392 transitions. [2019-10-22 11:26:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:25,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:25,492 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:26:25,493 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1572721449, now seen corresponding path program 1 times [2019-10-22 11:26:25,493 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:25,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019079365] [2019-10-22 11:26:25,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:25,562 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:26:25,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019079365] [2019-10-22 11:26:25,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:25,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:25,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936426174] [2019-10-22 11:26:25,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:25,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:25,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:25,563 INFO L87 Difference]: Start difference. First operand 289 states and 392 transitions. Second operand 6 states. [2019-10-22 11:26:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:25,786 INFO L93 Difference]: Finished difference Result 342 states and 423 transitions. [2019-10-22 11:26:25,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:25,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-22 11:26:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:25,788 INFO L225 Difference]: With dead ends: 342 [2019-10-22 11:26:25,788 INFO L226 Difference]: Without dead ends: 342 [2019-10-22 11:26:25,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-22 11:26:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 289. [2019-10-22 11:26:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-22 11:26:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 385 transitions. [2019-10-22 11:26:25,792 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 385 transitions. Word has length 19 [2019-10-22 11:26:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:25,793 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 385 transitions. [2019-10-22 11:26:25,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 385 transitions. [2019-10-22 11:26:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:26:25,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:25,793 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:26:25,795 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:25,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1408664633, now seen corresponding path program 1 times [2019-10-22 11:26:25,796 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:25,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055800566] [2019-10-22 11:26:25,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:26,016 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:26:26,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055800566] [2019-10-22 11:26:26,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:26,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:26,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284448891] [2019-10-22 11:26:26,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:26,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:26,018 INFO L87 Difference]: Start difference. First operand 289 states and 385 transitions. Second operand 9 states. [2019-10-22 11:26:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:26,582 INFO L93 Difference]: Finished difference Result 755 states and 936 transitions. [2019-10-22 11:26:26,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:26:26,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-22 11:26:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:26,584 INFO L225 Difference]: With dead ends: 755 [2019-10-22 11:26:26,584 INFO L226 Difference]: Without dead ends: 755 [2019-10-22 11:26:26,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:26:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-22 11:26:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 322. [2019-10-22 11:26:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-22 11:26:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 423 transitions. [2019-10-22 11:26:26,592 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 423 transitions. Word has length 20 [2019-10-22 11:26:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:26,593 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 423 transitions. [2019-10-22 11:26:26,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 423 transitions. [2019-10-22 11:26:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:26:26,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:26,593 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:26:26,594 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash -676296667, now seen corresponding path program 1 times [2019-10-22 11:26:26,594 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:26,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339598350] [2019-10-22 11:26:26,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:26,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:26,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:26,720 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:26:26,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339598350] [2019-10-22 11:26:26,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:26,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:26,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100691806] [2019-10-22 11:26:26,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:26:26,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:26:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:26,722 INFO L87 Difference]: Start difference. First operand 322 states and 423 transitions. Second operand 7 states. [2019-10-22 11:26:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:27,054 INFO L93 Difference]: Finished difference Result 606 states and 746 transitions. [2019-10-22 11:26:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:27,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-22 11:26:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:27,057 INFO L225 Difference]: With dead ends: 606 [2019-10-22 11:26:27,057 INFO L226 Difference]: Without dead ends: 606 [2019-10-22 11:26:27,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:26:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-22 11:26:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 324. [2019-10-22 11:26:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-22 11:26:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 425 transitions. [2019-10-22 11:26:27,065 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 425 transitions. Word has length 21 [2019-10-22 11:26:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:27,065 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 425 transitions. [2019-10-22 11:26:27,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:26:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 425 transitions. [2019-10-22 11:26:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:27,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:27,066 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] [2019-10-22 11:26:27,066 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash -811857942, now seen corresponding path program 1 times [2019-10-22 11:26:27,067 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:27,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430453163] [2019-10-22 11:26:27,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:27,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:27,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:27,326 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:26:27,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430453163] [2019-10-22 11:26:27,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:27,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:26:27,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529830864] [2019-10-22 11:26:27,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:27,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:27,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:27,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:27,328 INFO L87 Difference]: Start difference. First operand 324 states and 425 transitions. Second operand 9 states. [2019-10-22 11:26:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:28,123 INFO L93 Difference]: Finished difference Result 913 states and 1106 transitions. [2019-10-22 11:26:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:26:28,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:26:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:28,126 INFO L225 Difference]: With dead ends: 913 [2019-10-22 11:26:28,126 INFO L226 Difference]: Without dead ends: 913 [2019-10-22 11:26:28,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-10-22 11:26:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-10-22 11:26:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 362. [2019-10-22 11:26:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-10-22 11:26:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 471 transitions. [2019-10-22 11:26:28,135 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 471 transitions. Word has length 22 [2019-10-22 11:26:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:28,135 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 471 transitions. [2019-10-22 11:26:28,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 471 transitions. [2019-10-22 11:26:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:26:28,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:28,136 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:26:28,136 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:28,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:28,136 INFO L82 PathProgramCache]: Analyzing trace with hash 692956189, now seen corresponding path program 1 times [2019-10-22 11:26:28,137 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:28,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149334083] [2019-10-22 11:26:28,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:28,224 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:26:28,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149334083] [2019-10-22 11:26:28,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:28,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:28,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187875468] [2019-10-22 11:26:28,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:28,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:28,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:28,226 INFO L87 Difference]: Start difference. First operand 362 states and 471 transitions. Second operand 5 states. [2019-10-22 11:26:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:28,348 INFO L93 Difference]: Finished difference Result 415 states and 521 transitions. [2019-10-22 11:26:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:28,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-22 11:26:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:28,349 INFO L225 Difference]: With dead ends: 415 [2019-10-22 11:26:28,350 INFO L226 Difference]: Without dead ends: 415 [2019-10-22 11:26:28,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-10-22 11:26:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 362. [2019-10-22 11:26:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-10-22 11:26:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 470 transitions. [2019-10-22 11:26:28,355 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 470 transitions. Word has length 23 [2019-10-22 11:26:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:28,355 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 470 transitions. [2019-10-22 11:26:28,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 470 transitions. [2019-10-22 11:26:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:26:28,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:28,356 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:26:28,357 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:28,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:28,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1380879160, now seen corresponding path program 1 times [2019-10-22 11:26:28,357 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:28,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975212927] [2019-10-22 11:26:28,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:28,441 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:26:28,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975212927] [2019-10-22 11:26:28,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:28,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:28,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598958237] [2019-10-22 11:26:28,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:28,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:28,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:28,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:28,443 INFO L87 Difference]: Start difference. First operand 362 states and 470 transitions. Second operand 6 states. [2019-10-22 11:26:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:28,597 INFO L93 Difference]: Finished difference Result 394 states and 483 transitions. [2019-10-22 11:26:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:28,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-22 11:26:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:28,598 INFO L225 Difference]: With dead ends: 394 [2019-10-22 11:26:28,598 INFO L226 Difference]: Without dead ends: 394 [2019-10-22 11:26:28,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-22 11:26:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 361. [2019-10-22 11:26:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 11:26:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 468 transitions. [2019-10-22 11:26:28,603 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 468 transitions. Word has length 23 [2019-10-22 11:26:28,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:28,603 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 468 transitions. [2019-10-22 11:26:28,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 468 transitions. [2019-10-22 11:26:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:26:28,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:28,604 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, 1] [2019-10-22 11:26:28,604 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:28,604 INFO L82 PathProgramCache]: Analyzing trace with hash 6805574, now seen corresponding path program 1 times [2019-10-22 11:26:28,605 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:28,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826013008] [2019-10-22 11:26:28,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:28,748 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:26:28,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826013008] [2019-10-22 11:26:28,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:28,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:26:28,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841127758] [2019-10-22 11:26:28,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:26:28,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:28,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:26:28,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:28,749 INFO L87 Difference]: Start difference. First operand 361 states and 468 transitions. Second operand 8 states. [2019-10-22 11:26:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:28,976 INFO L93 Difference]: Finished difference Result 361 states and 436 transitions. [2019-10-22 11:26:28,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:28,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-10-22 11:26:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:28,978 INFO L225 Difference]: With dead ends: 361 [2019-10-22 11:26:28,978 INFO L226 Difference]: Without dead ends: 361 [2019-10-22 11:26:28,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:26:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-22 11:26:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 249. [2019-10-22 11:26:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-22 11:26:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 304 transitions. [2019-10-22 11:26:28,981 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 304 transitions. Word has length 24 [2019-10-22 11:26:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:28,981 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 304 transitions. [2019-10-22 11:26:28,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:26:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 304 transitions. [2019-10-22 11:26:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:26:28,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:28,982 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, 1] [2019-10-22 11:26:28,983 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:28,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:28,983 INFO L82 PathProgramCache]: Analyzing trace with hash 142419018, now seen corresponding path program 1 times [2019-10-22 11:26:28,983 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:28,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539904072] [2019-10-22 11:26:28,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:29,049 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:26:29,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539904072] [2019-10-22 11:26:29,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:29,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:29,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802598093] [2019-10-22 11:26:29,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:29,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:29,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:29,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:29,051 INFO L87 Difference]: Start difference. First operand 249 states and 304 transitions. Second operand 6 states. [2019-10-22 11:26:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:29,301 INFO L93 Difference]: Finished difference Result 633 states and 758 transitions. [2019-10-22 11:26:29,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:29,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:26:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:29,303 INFO L225 Difference]: With dead ends: 633 [2019-10-22 11:26:29,303 INFO L226 Difference]: Without dead ends: 633 [2019-10-22 11:26:29,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-22 11:26:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 253. [2019-10-22 11:26:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-22 11:26:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2019-10-22 11:26:29,308 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 24 [2019-10-22 11:26:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:29,308 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2019-10-22 11:26:29,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2019-10-22 11:26:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:26:29,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:29,309 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, 1, 1] [2019-10-22 11:26:29,309 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:29,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1099088150, now seen corresponding path program 1 times [2019-10-22 11:26:29,309 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:29,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006744496] [2019-10-22 11:26:29,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:29,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:29,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:29,372 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:26:29,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006744496] [2019-10-22 11:26:29,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:29,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:29,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403817346] [2019-10-22 11:26:29,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:29,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:29,373 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand 5 states. [2019-10-22 11:26:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:29,456 INFO L93 Difference]: Finished difference Result 251 states and 304 transitions. [2019-10-22 11:26:29,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:29,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:26:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:29,457 INFO L225 Difference]: With dead ends: 251 [2019-10-22 11:26:29,457 INFO L226 Difference]: Without dead ends: 251 [2019-10-22 11:26:29,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-22 11:26:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2019-10-22 11:26:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-22 11:26:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 256 transitions. [2019-10-22 11:26:29,459 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 256 transitions. Word has length 25 [2019-10-22 11:26:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:29,460 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 256 transitions. [2019-10-22 11:26:29,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 256 transitions. [2019-10-22 11:26:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:26:29,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:29,460 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:29,460 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION]=== [2019-10-22 11:26:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:29,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1892225549, now seen corresponding path program 1 times [2019-10-22 11:26:29,461 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:29,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935386809] [2019-10-22 11:26:29,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:29,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:29,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:29,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935386809] [2019-10-22 11:26:29,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493944157] [2019-10-22 11:26:29,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:29,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 11:26:29,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:29,877 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:29,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:29,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-10-22 11:26:29,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:30,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:30,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2019-10-22 11:26:30,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:30,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-22 11:26:30,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:30,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-10-22 11:26:30,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-10-22 11:26:30,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:30,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1601453375] [2019-10-22 11:26:30,133 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 33 [2019-10-22 11:26:30,180 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:26:30,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:26:30,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:30,493 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:26:30,497 INFO L168 Benchmark]: Toolchain (without parser) took 13257.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 936.9 MB in the beginning and 1.3 GB in the end (delta: -367.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:30,498 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:30,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:30,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.34 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:30,499 INFO L168 Benchmark]: Boogie Preprocessor took 43.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:30,499 INFO L168 Benchmark]: RCFGBuilder took 744.87 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: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:30,500 INFO L168 Benchmark]: TraceAbstraction took 11761.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -253.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:30,503 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.34 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 744.87 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: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11761.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -253.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:32,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:32,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:32,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:32,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:32,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:32,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:32,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:32,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:32,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:32,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:32,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:32,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:32,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:32,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:32,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:32,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:32,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:32,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:32,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:32,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:32,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:32,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:32,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:32,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:32,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:32,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:32,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:32,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:32,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:32,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:32,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:32,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:32,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:32,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:32,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:32,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:32,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:32,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:32,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:32,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:32,792 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:26:32,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:32,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:32,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:32,804 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:32,804 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:32,804 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:32,804 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:32,804 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:32,804 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:32,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:26:32,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:26:32,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:32,806 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:32,806 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:26:32,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:32,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:32,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:32,807 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:26:32,807 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:26:32,807 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:26:32,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:32,807 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:26:32,807 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:26:32,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:32,808 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:26:32,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:32,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:32,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:32,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:32,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:32,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:32,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:32,809 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:26:32,809 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:26:32,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:32,809 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/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 -> bbad5595d4a380534920239c65f21022d7390d8a [2019-10-22 11:26:32,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:32,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:32,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:32,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:32,869 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:32,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0214.i [2019-10-22 11:26:32,921 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data/c4a555bd2/9d185c1743f047398c1af2ab3f3d1d9c/FLAGc3b1b8e7b [2019-10-22 11:26:33,360 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:33,361 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/sv-benchmarks/c/memsafety/test-0214.i [2019-10-22 11:26:33,369 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data/c4a555bd2/9d185c1743f047398c1af2ab3f3d1d9c/FLAGc3b1b8e7b [2019-10-22 11:26:33,681 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/data/c4a555bd2/9d185c1743f047398c1af2ab3f3d1d9c [2019-10-22 11:26:33,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:33,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:33,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:33,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:33,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:33,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba7f537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:33, skipping insertion in model container [2019-10-22 11:26:33,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:33" (1/1) ... [2019-10-22 11:26:33,700 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:33,746 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:34,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:34,201 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:34,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:34,330 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:34,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34 WrapperNode [2019-10-22 11:26:34,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:34,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:34,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:34,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:34,340 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:26:34" (1/1) ... [2019-10-22 11:26:34,360 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:26:34" (1/1) ... [2019-10-22 11:26:34,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:34,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:34,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:34,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:34,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:34,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:34,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:34,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:34,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/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:26:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-10-22 11:26:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:26:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:34,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:35,331 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:35,332 INFO L284 CfgBuilder]: Removed 22 assume(true) statements. [2019-10-22 11:26:35,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:35 BoogieIcfgContainer [2019-10-22 11:26:35,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:35,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:35,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:35,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:35,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:33" (1/3) ... [2019-10-22 11:26:35,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f941f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:35, skipping insertion in model container [2019-10-22 11:26:35,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (2/3) ... [2019-10-22 11:26:35,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f941f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:35, skipping insertion in model container [2019-10-22 11:26:35,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:35" (3/3) ... [2019-10-22 11:26:35,342 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0214.i [2019-10-22 11:26:35,352 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:35,360 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-10-22 11:26:35,372 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-10-22 11:26:35,387 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:35,387 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:26:35,387 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:35,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:35,388 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:35,388 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:35,388 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:35,388 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-10-22 11:26:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:26:35,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION]=== [2019-10-22 11:26:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash 889838396, now seen corresponding path program 1 times [2019-10-22 11:26:35,428 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:35,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1304707860] [2019-10-22 11:26:35,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33db0c0b-da44-4db0-97ce-d0ed6f43b394/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:35,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:35,678 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort FloatRoundingMode not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:26:35,684 INFO L168 Benchmark]: Toolchain (without parser) took 1998.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -102.6 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,686 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:35,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,690 INFO L168 Benchmark]: Boogie Preprocessor took 45.52 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:26:35,691 INFO L168 Benchmark]: RCFGBuilder took 893.07 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,691 INFO L168 Benchmark]: TraceAbstraction took 346.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,696 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 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.52 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 893.07 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 346.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort FloatRoundingMode not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...