./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.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_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i -s /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/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 f5fe233deb2e42c866080d038fc03ab5db72ce97 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i -s /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/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 f5fe233deb2e42c866080d038fc03ab5db72ce97 ........................................................................................................................................................................................................................................................ 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:24:46,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:46,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:46,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:46,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:46,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:46,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:46,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:46,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:46,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:46,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:46,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:46,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:46,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:46,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:46,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:46,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:46,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:46,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:46,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:46,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:46,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:46,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:46,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:46,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:46,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:46,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:46,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:46,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:46,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:46,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:46,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:46,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:46,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:46,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:46,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:46,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:46,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:46,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:46,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:46,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:46,746 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:24:46,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:46,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:46,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:46,762 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:46,763 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:46,763 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:46,763 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:46,763 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:46,763 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:46,763 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:46,763 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:46,764 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:46,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:24:46,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:24:46,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:46,765 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:46,765 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:24:46,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:46,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:46,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:46,766 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:24:46,766 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:24:46,766 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:24:46,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:46,766 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:46,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:46,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:46,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:46,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:46,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:46,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:46,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:46,768 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:46,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:46,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:46,770 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_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/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 -> f5fe233deb2e42c866080d038fc03ab5db72ce97 [2019-10-22 11:24:46,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:46,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:46,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:46,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:46,827 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:46,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-10-22 11:24:46,875 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data/3cfd06d4e/9f82ee9a70c543ec8a1dd49ae76d6374/FLAG76ce602e1 [2019-10-22 11:24:47,316 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:47,317 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-10-22 11:24:47,329 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data/3cfd06d4e/9f82ee9a70c543ec8a1dd49ae76d6374/FLAG76ce602e1 [2019-10-22 11:24:47,342 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data/3cfd06d4e/9f82ee9a70c543ec8a1dd49ae76d6374 [2019-10-22 11:24:47,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:47,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:47,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:47,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:47,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:47,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:47,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbf130a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47, skipping insertion in model container [2019-10-22 11:24:47,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:47,369 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:47,415 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:47,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:47,874 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:47,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:47,997 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:47,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47 WrapperNode [2019-10-22 11:24:47,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:47,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:47,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:47,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:48,006 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:24:47" (1/1) ... [2019-10-22 11:24:48,027 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:24:47" (1/1) ... [2019-10-22 11:24:48,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:48,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:48,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:48,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:48,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:48,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:48,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:48,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:48,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:48,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:48,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:48,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:48,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:48,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:48,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:48,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/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:24:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:24:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:24:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:24:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:48,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:48,674 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:48,675 INFO L284 CfgBuilder]: Removed 50 assume(true) statements. [2019-10-22 11:24:48,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:48 BoogieIcfgContainer [2019-10-22 11:24:48,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:48,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:48,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:48,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:48,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:47" (1/3) ... [2019-10-22 11:24:48,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1bb72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:48, skipping insertion in model container [2019-10-22 11:24:48,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47" (2/3) ... [2019-10-22 11:24:48,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1bb72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:48, skipping insertion in model container [2019-10-22 11:24:48,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:48" (3/3) ... [2019-10-22 11:24:48,683 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2019-10-22 11:24:48,691 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:48,697 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-10-22 11:24:48,705 INFO L249 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-10-22 11:24:48,720 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:48,721 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:24:48,721 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:48,721 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:48,721 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:48,721 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:48,721 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:48,721 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2019-10-22 11:24:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:24:48,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:48,745 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:24:48,748 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2019-10-22 11:24:48,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:48,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362679599] [2019-10-22 11:24:48,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:48,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:48,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:48,906 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:24:48,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362679599] [2019-10-22 11:24:48,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:48,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:48,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845309912] [2019-10-22 11:24:48,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:48,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:48,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:48,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:48,929 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2019-10-22 11:24:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:49,273 INFO L93 Difference]: Finished difference Result 268 states and 291 transitions. [2019-10-22 11:24:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:49,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-10-22 11:24:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:49,286 INFO L225 Difference]: With dead ends: 268 [2019-10-22 11:24:49,286 INFO L226 Difference]: Without dead ends: 260 [2019-10-22 11:24:49,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:24:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-22 11:24:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 93. [2019-10-22 11:24:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 11:24:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2019-10-22 11:24:49,327 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 6 [2019-10-22 11:24:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:49,327 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-10-22 11:24:49,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2019-10-22 11:24:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:24:49,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:49,328 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:24:49,329 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2019-10-22 11:24:49,329 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:49,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17794852] [2019-10-22 11:24:49,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:49,369 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:24:49,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17794852] [2019-10-22 11:24:49,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:49,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:49,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678961502] [2019-10-22 11:24:49,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:49,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:49,371 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 4 states. [2019-10-22 11:24:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:49,400 INFO L93 Difference]: Finished difference Result 223 states and 243 transitions. [2019-10-22 11:24:49,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:49,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:24:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:49,402 INFO L225 Difference]: With dead ends: 223 [2019-10-22 11:24:49,402 INFO L226 Difference]: Without dead ends: 223 [2019-10-22 11:24:49,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-10-22 11:24:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 91. [2019-10-22 11:24:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-22 11:24:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2019-10-22 11:24:49,410 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 6 [2019-10-22 11:24:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:49,410 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2019-10-22 11:24:49,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2019-10-22 11:24:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:24:49,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:49,411 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:49,412 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968328, now seen corresponding path program 1 times [2019-10-22 11:24:49,412 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:49,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353338869] [2019-10-22 11:24:49,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:49,476 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:24:49,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353338869] [2019-10-22 11:24:49,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:49,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:49,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860545564] [2019-10-22 11:24:49,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:49,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:49,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:49,478 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 6 states. [2019-10-22 11:24:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:49,668 INFO L93 Difference]: Finished difference Result 222 states and 242 transitions. [2019-10-22 11:24:49,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:49,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-10-22 11:24:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:49,670 INFO L225 Difference]: With dead ends: 222 [2019-10-22 11:24:49,670 INFO L226 Difference]: Without dead ends: 222 [2019-10-22 11:24:49,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-22 11:24:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 90. [2019-10-22 11:24:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 11:24:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2019-10-22 11:24:49,685 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 7 [2019-10-22 11:24:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:49,685 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2019-10-22 11:24:49,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2019-10-22 11:24:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:24:49,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:49,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:49,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:49,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:49,687 INFO L82 PathProgramCache]: Analyzing trace with hash 119421555, now seen corresponding path program 1 times [2019-10-22 11:24:49,687 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:49,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75277059] [2019-10-22 11:24:49,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:49,747 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:24:49,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75277059] [2019-10-22 11:24:49,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:49,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:49,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606605896] [2019-10-22 11:24:49,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:49,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:49,749 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 4 states. [2019-10-22 11:24:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:49,773 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2019-10-22 11:24:49,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:49,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:24:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:49,774 INFO L225 Difference]: With dead ends: 156 [2019-10-22 11:24:49,775 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 11:24:49,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 11:24:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 90. [2019-10-22 11:24:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 11:24:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-10-22 11:24:49,789 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 8 [2019-10-22 11:24:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:49,789 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-10-22 11:24:49,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-10-22 11:24:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:24:49,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:49,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:49,791 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:49,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:49,791 INFO L82 PathProgramCache]: Analyzing trace with hash 176679857, now seen corresponding path program 1 times [2019-10-22 11:24:49,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:49,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577121844] [2019-10-22 11:24:49,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:49,888 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:24:49,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577121844] [2019-10-22 11:24:49,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:49,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:49,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575421249] [2019-10-22 11:24:49,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:49,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:49,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:49,891 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 4 states. [2019-10-22 11:24:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:49,933 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2019-10-22 11:24:49,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:49,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:24:49,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:49,935 INFO L225 Difference]: With dead ends: 131 [2019-10-22 11:24:49,935 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 11:24:49,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 11:24:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92. [2019-10-22 11:24:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 11:24:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-10-22 11:24:49,941 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 8 [2019-10-22 11:24:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:49,942 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-10-22 11:24:49,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-10-22 11:24:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:24:49,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:49,943 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:49,943 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2007928746, now seen corresponding path program 1 times [2019-10-22 11:24:49,944 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:49,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224147567] [2019-10-22 11:24:49,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:49,972 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:24:49,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224147567] [2019-10-22 11:24:49,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:49,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:49,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927817870] [2019-10-22 11:24:49,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:49,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:49,974 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 3 states. [2019-10-22 11:24:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,030 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-10-22 11:24:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:50,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 11:24:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,031 INFO L225 Difference]: With dead ends: 117 [2019-10-22 11:24:50,031 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 11:24:50,032 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:24:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 11:24:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2019-10-22 11:24:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-22 11:24:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-10-22 11:24:50,036 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 10 [2019-10-22 11:24:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,036 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-10-22 11:24:50,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-10-22 11:24:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:24:50,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,037 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,038 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2007930219, now seen corresponding path program 1 times [2019-10-22 11:24:50,038 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889607102] [2019-10-22 11:24:50,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:50,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889607102] [2019-10-22 11:24:50,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:50,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663494693] [2019-10-22 11:24:50,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:50,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:50,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:50,108 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 5 states. [2019-10-22 11:24:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,139 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2019-10-22 11:24:50,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:50,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-22 11:24:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,140 INFO L225 Difference]: With dead ends: 97 [2019-10-22 11:24:50,140 INFO L226 Difference]: Without dead ends: 91 [2019-10-22 11:24:50,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-22 11:24:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-10-22 11:24:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:24:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2019-10-22 11:24:50,144 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 10 [2019-10-22 11:24:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,145 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-10-22 11:24:50,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2019-10-22 11:24:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:24:50,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,145 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,146 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:50,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash 820865718, now seen corresponding path program 1 times [2019-10-22 11:24:50,146 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586529545] [2019-10-22 11:24:50,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,193 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:24:50,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586529545] [2019-10-22 11:24:50,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:50,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261111637] [2019-10-22 11:24:50,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:50,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:50,195 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 7 states. [2019-10-22 11:24:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,455 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2019-10-22 11:24:50,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:50,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-10-22 11:24:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,456 INFO L225 Difference]: With dead ends: 217 [2019-10-22 11:24:50,456 INFO L226 Difference]: Without dead ends: 217 [2019-10-22 11:24:50,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-22 11:24:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 87. [2019-10-22 11:24:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 11:24:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-10-22 11:24:50,461 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 12 [2019-10-22 11:24:50,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,461 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-10-22 11:24:50,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-10-22 11:24:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:24:50,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,462 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,462 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:50,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,463 INFO L82 PathProgramCache]: Analyzing trace with hash 820865719, now seen corresponding path program 1 times [2019-10-22 11:24:50,463 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804189282] [2019-10-22 11:24:50,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,490 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:24:50,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804189282] [2019-10-22 11:24:50,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:50,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900335268] [2019-10-22 11:24:50,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:50,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:50,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:50,492 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 4 states. [2019-10-22 11:24:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,501 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2019-10-22 11:24:50,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:50,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:24:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,502 INFO L225 Difference]: With dead ends: 88 [2019-10-22 11:24:50,502 INFO L226 Difference]: Without dead ends: 88 [2019-10-22 11:24:50,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-22 11:24:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-10-22 11:24:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:24:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2019-10-22 11:24:50,505 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 12 [2019-10-22 11:24:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,505 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-10-22 11:24:50,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2019-10-22 11:24:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:50,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,506 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,506 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,507 INFO L82 PathProgramCache]: Analyzing trace with hash -382225645, now seen corresponding path program 1 times [2019-10-22 11:24:50,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372879340] [2019-10-22 11:24:50,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:50,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372879340] [2019-10-22 11:24:50,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:50,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566897909] [2019-10-22 11:24:50,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:50,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:50,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:50,616 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 9 states. [2019-10-22 11:24:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,854 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2019-10-22 11:24:50,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:50,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-10-22 11:24:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,856 INFO L225 Difference]: With dead ends: 221 [2019-10-22 11:24:50,856 INFO L226 Difference]: Without dead ends: 221 [2019-10-22 11:24:50,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-22 11:24:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 87. [2019-10-22 11:24:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 11:24:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-10-22 11:24:50,859 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2019-10-22 11:24:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,860 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-10-22 11:24:50,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-10-22 11:24:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:24:50,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,861 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,861 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2046988466, now seen corresponding path program 1 times [2019-10-22 11:24:50,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614265010] [2019-10-22 11:24:50,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:50,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614265010] [2019-10-22 11:24:50,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:50,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391208591] [2019-10-22 11:24:50,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:50,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:50,900 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2019-10-22 11:24:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,931 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-10-22 11:24:50,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:50,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-22 11:24:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,932 INFO L225 Difference]: With dead ends: 87 [2019-10-22 11:24:50,932 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 11:24:50,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 11:24:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-10-22 11:24:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 11:24:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2019-10-22 11:24:50,934 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 15 [2019-10-22 11:24:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,935 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2019-10-22 11:24:50,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2019-10-22 11:24:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:24:50,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,936 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2048342003, now seen corresponding path program 1 times [2019-10-22 11:24:50,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339944438] [2019-10-22 11:24:50,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:50,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339944438] [2019-10-22 11:24:50,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:50,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197634695] [2019-10-22 11:24:50,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:50,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:50,981 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 7 states. [2019-10-22 11:24:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,151 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2019-10-22 11:24:51,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:51,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-22 11:24:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,152 INFO L225 Difference]: With dead ends: 164 [2019-10-22 11:24:51,152 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 11:24:51,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 11:24:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 85. [2019-10-22 11:24:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:24:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-10-22 11:24:51,155 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 15 [2019-10-22 11:24:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,156 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-10-22 11:24:51,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-10-22 11:24:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:24:51,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,157 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,158 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2048342004, now seen corresponding path program 1 times [2019-10-22 11:24:51,158 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293482585] [2019-10-22 11:24:51,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:51,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293482585] [2019-10-22 11:24:51,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:51,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681350567] [2019-10-22 11:24:51,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:51,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:51,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:51,246 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 8 states. [2019-10-22 11:24:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,415 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2019-10-22 11:24:51,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:51,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-10-22 11:24:51,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,416 INFO L225 Difference]: With dead ends: 150 [2019-10-22 11:24:51,416 INFO L226 Difference]: Without dead ends: 150 [2019-10-22 11:24:51,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:24:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-22 11:24:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2019-10-22 11:24:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 11:24:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-10-22 11:24:51,419 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 15 [2019-10-22 11:24:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,419 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-10-22 11:24:51,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-10-22 11:24:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:24:51,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,420 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:24:51,420 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,421 INFO L82 PathProgramCache]: Analyzing trace with hash -927294538, now seen corresponding path program 1 times [2019-10-22 11:24:51,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554438925] [2019-10-22 11:24:51,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:51,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554438925] [2019-10-22 11:24:51,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:51,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208596592] [2019-10-22 11:24:51,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:51,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:51,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:51,464 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 7 states. [2019-10-22 11:24:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,504 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-10-22 11:24:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:51,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-10-22 11:24:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,505 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:24:51,505 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 11:24:51,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:51,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 11:24:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-22 11:24:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 11:24:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-10-22 11:24:51,506 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 16 [2019-10-22 11:24:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,507 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-10-22 11:24:51,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-10-22 11:24:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:24:51,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,507 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:24:51,507 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1235581409, now seen corresponding path program 1 times [2019-10-22 11:24:51,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238325310] [2019-10-22 11:24:51,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:51,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238325310] [2019-10-22 11:24:51,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:24:51,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061582495] [2019-10-22 11:24:51,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:51,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:51,588 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 10 states. [2019-10-22 11:24:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,814 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-10-22 11:24:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:51,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-10-22 11:24:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,815 INFO L225 Difference]: With dead ends: 115 [2019-10-22 11:24:51,815 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:24:51,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:24:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:24:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 80. [2019-10-22 11:24:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 11:24:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2019-10-22 11:24:51,818 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 20 [2019-10-22 11:24:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,818 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2019-10-22 11:24:51,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2019-10-22 11:24:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:24:51,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,819 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:24:51,819 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:51,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1235581408, now seen corresponding path program 1 times [2019-10-22 11:24:51,819 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041921204] [2019-10-22 11:24:51,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:51,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041921204] [2019-10-22 11:24:51,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:51,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337062315] [2019-10-22 11:24:51,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:51,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:51,933 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 8 states. [2019-10-22 11:24:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,097 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-10-22 11:24:52,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:52,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-22 11:24:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,099 INFO L225 Difference]: With dead ends: 82 [2019-10-22 11:24:52,099 INFO L226 Difference]: Without dead ends: 82 [2019-10-22 11:24:52,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:24:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-22 11:24:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-10-22 11:24:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:24:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-10-22 11:24:52,101 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 20 [2019-10-22 11:24:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,101 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-10-22 11:24:52,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-10-22 11:24:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:52,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,102 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:24:52,102 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1981339836, now seen corresponding path program 1 times [2019-10-22 11:24:52,103 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46173883] [2019-10-22 11:24:52,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:52,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46173883] [2019-10-22 11:24:52,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:52,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092533834] [2019-10-22 11:24:52,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:52,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:52,165 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 7 states. [2019-10-22 11:24:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,225 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-10-22 11:24:52,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:52,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-10-22 11:24:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,226 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:24:52,226 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:24:52,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:24:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-22 11:24:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:24:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-10-22 11:24:52,228 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 22 [2019-10-22 11:24:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,228 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-10-22 11:24:52,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-10-22 11:24:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:52,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,229 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, 1] [2019-10-22 11:24:52,229 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash 746116899, now seen corresponding path program 1 times [2019-10-22 11:24:52,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719234525] [2019-10-22 11:24:52,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:52,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719234525] [2019-10-22 11:24:52,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:24:52,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551164534] [2019-10-22 11:24:52,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:24:52,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:24:52,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:52,344 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 11 states. [2019-10-22 11:24:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,605 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-10-22 11:24:52,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:24:52,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-10-22 11:24:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,606 INFO L225 Difference]: With dead ends: 103 [2019-10-22 11:24:52,606 INFO L226 Difference]: Without dead ends: 103 [2019-10-22 11:24:52,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:24:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-22 11:24:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2019-10-22 11:24:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:24:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-10-22 11:24:52,607 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 26 [2019-10-22 11:24:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,607 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-10-22 11:24:52,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:24:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-10-22 11:24:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:52,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,608 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, 1] [2019-10-22 11:24:52,608 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:24:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash 746116900, now seen corresponding path program 1 times [2019-10-22 11:24:52,609 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454539557] [2019-10-22 11:24:52,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454539557] [2019-10-22 11:24:52,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979710181] [2019-10-22 11:24:52,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/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:24:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:24:52,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,778 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1162524539] [2019-10-22 11:24:52,809 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 27 [2019-10-22 11:24:52,841 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:24:52,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:24:53,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:53,114 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:24:53,119 INFO L168 Benchmark]: Toolchain (without parser) took 5771.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 939.1 MB in the beginning and 980.4 MB in the end (delta: -41.3 MB). Peak memory consumption was 131.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:53,120 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 964.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:53,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:53,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.57 ms. Allocated memory is still 1.1 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:24:53,121 INFO L168 Benchmark]: Boogie Preprocessor took 42.45 ms. Allocated memory is still 1.1 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:24:53,121 INFO L168 Benchmark]: RCFGBuilder took 579.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:53,122 INFO L168 Benchmark]: TraceAbstraction took 4440.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.0 GB in the beginning and 980.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:53,125 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 964.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 649.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.57 ms. Allocated memory is still 1.1 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 42.45 ms. Allocated memory is still 1.1 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 579.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4440.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.0 GB in the beginning and 980.4 MB in the end (delta: 46.9 MB). Peak memory consumption was 104.6 MB. 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:24:55,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:55,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:55,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:55,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:55,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:55,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:55,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:55,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:55,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:55,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:55,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:55,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:55,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:55,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:55,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:55,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:55,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:55,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:55,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:55,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:55,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:55,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:55,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:55,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:55,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:55,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:55,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:55,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:55,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:55,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:55,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:55,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:55,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:55,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:55,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:55,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:55,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:55,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:55,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:55,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:55,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:24:55,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:55,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:55,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:55,369 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:55,369 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:55,369 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:55,369 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:55,369 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:55,369 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:55,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:24:55,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:24:55,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:55,371 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:55,371 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:24:55,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:55,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:55,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:55,372 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:24:55,372 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:24:55,372 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:24:55,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:55,373 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:24:55,373 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:24:55,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:55,373 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:24:55,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:55,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:55,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:55,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:55,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:55,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:55,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:55,375 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:24:55,375 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:24:55,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:55,375 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_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/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 -> f5fe233deb2e42c866080d038fc03ab5db72ce97 [2019-10-22 11:24:55,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:55,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:55,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:55,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:55,429 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:55,430 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-10-22 11:24:55,493 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data/7bcdc48de/63623b27ed694f21a885001c59db9f1d/FLAG793cc1822 [2019-10-22 11:24:56,079 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:56,081 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-10-22 11:24:56,094 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data/7bcdc48de/63623b27ed694f21a885001c59db9f1d/FLAG793cc1822 [2019-10-22 11:24:56,370 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/bin/utaipan/data/7bcdc48de/63623b27ed694f21a885001c59db9f1d [2019-10-22 11:24:56,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:56,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:56,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:56,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:56,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:56,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f823c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:56, skipping insertion in model container [2019-10-22 11:24:56,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:56" (1/1) ... [2019-10-22 11:24:56,390 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:56,431 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:56,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:56,905 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:56,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:57,088 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:57,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57 WrapperNode [2019-10-22 11:24:57,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:57,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:57,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:57,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:57,101 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:24:57" (1/1) ... [2019-10-22 11:24:57,124 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:24:57" (1/1) ... [2019-10-22 11:24:57,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:57,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:57,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:57,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:57,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:57,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:57,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:57,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:57,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/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:24:57,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:24:57,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:57,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:57,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:57,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:57,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:24:57,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:24:57,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:57,860 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:57,860 INFO L284 CfgBuilder]: Removed 50 assume(true) statements. [2019-10-22 11:24:57,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:57 BoogieIcfgContainer [2019-10-22 11:24:57,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:57,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:57,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:57,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:57,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:56" (1/3) ... [2019-10-22 11:24:57,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b03a2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:57, skipping insertion in model container [2019-10-22 11:24:57,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57" (2/3) ... [2019-10-22 11:24:57,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b03a2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:57, skipping insertion in model container [2019-10-22 11:24:57,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:57" (3/3) ... [2019-10-22 11:24:57,871 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2019-10-22 11:24:57,881 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:57,888 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-10-22 11:24:57,898 INFO L249 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-10-22 11:24:57,916 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:57,917 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:24:57,917 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:57,917 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:57,917 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:57,917 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:57,917 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:57,918 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2019-10-22 11:24:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:24:57,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:57,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:24:57,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2019-10-22 11:24:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2019-10-22 11:24:57,964 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:57,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [21429000] [2019-10-22 11:24:57,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aaedaf78-fffd-40d3-90b8-1b0875e3e2fc/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:24:58,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:58,252 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:24:58,264 INFO L168 Benchmark]: Toolchain (without parser) took 1888.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -121.8 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,265 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:58,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.24 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:24:58,268 INFO L168 Benchmark]: Boogie Preprocessor took 40.62 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.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,268 INFO L168 Benchmark]: RCFGBuilder took 663.27 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: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,269 INFO L168 Benchmark]: TraceAbstraction took 397.89 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,275 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 714.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.62 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.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 663.27 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: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 397.89 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: 17.6 MB). Peak memory consumption was 17.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...