./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/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 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:31:45,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:31:45,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:31:45,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:31:45,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:31:45,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:31:45,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:31:45,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:31:45,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:31:45,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:31:45,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:31:45,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:31:45,486 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:31:45,487 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:31:45,487 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:31:45,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:31:45,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:31:45,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:31:45,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:31:45,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:31:45,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:31:45,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:31:45,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:31:45,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:31:45,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:31:45,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:31:45,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:31:45,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:31:45,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:31:45,496 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:31:45,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:31:45,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:31:45,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:31:45,497 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:31:45,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:31:45,498 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:31:45,498 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 15:31:45,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:31:45,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:31:45,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:31:45,506 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:31:45,506 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:31:45,506 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:31:45,506 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:31:45,506 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 15:31:45,507 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:31:45,507 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:31:45,507 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 15:31:45,507 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 15:31:45,507 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:31:45,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:31:45,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:31:45,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:31:45,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:31:45,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:31:45,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:31:45,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:31:45,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:31:45,508 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 15:31:45,509 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 15:31:45,509 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 15:31:45,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:31:45,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:31:45,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:31:45,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:31:45,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:31:45,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:31:45,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:31:45,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:31:45,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:31:45,510 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 15:31:45,510 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:31:45,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:31:45,510 INFO L133 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_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/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 -> 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 [2018-12-09 15:31:45,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:31:45,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:31:45,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:31:45,542 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:31:45,542 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:31:45,542 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-12-09 15:31:45,580 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/data/a83dd1c99/4220092d47e9436ba776d213a3049fc0/FLAG06341bc17 [2018-12-09 15:31:45,878 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:31:45,878 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/sv-benchmarks/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-12-09 15:31:45,882 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/data/a83dd1c99/4220092d47e9436ba776d213a3049fc0/FLAG06341bc17 [2018-12-09 15:31:45,889 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/data/a83dd1c99/4220092d47e9436ba776d213a3049fc0 [2018-12-09 15:31:45,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:31:45,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:31:45,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:31:45,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:31:45,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:31:45,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:31:45" (1/1) ... [2018-12-09 15:31:45,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630ff43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:45, skipping insertion in model container [2018-12-09 15:31:45,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:31:45" (1/1) ... [2018-12-09 15:31:45,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:31:45,909 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:31:45,991 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:31:45,999 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:31:46,008 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:31:46,017 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:31:46,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46 WrapperNode [2018-12-09 15:31:46,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:31:46,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:31:46,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:31:46,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:31:46,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:31:46,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:31:46,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:31:46,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:31:46,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... [2018-12-09 15:31:46,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:31:46,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:31:46,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:31:46,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:31:46,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/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 [2018-12-09 15:31:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:31:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2018-12-09 15:31:46,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2018-12-09 15:31:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:31:46,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:31:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:31:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:31:46,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:31:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 15:31:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:31:46,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:31:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:31:46,231 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:31:46,231 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 15:31:46,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:31:46 BoogieIcfgContainer [2018-12-09 15:31:46,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:31:46,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:31:46,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:31:46,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:31:46,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:31:45" (1/3) ... [2018-12-09 15:31:46,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8cdf7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:31:46, skipping insertion in model container [2018-12-09 15:31:46,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:46" (2/3) ... [2018-12-09 15:31:46,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8cdf7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:31:46, skipping insertion in model container [2018-12-09 15:31:46,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:31:46" (3/3) ... [2018-12-09 15:31:46,237 INFO L112 eAbstractionObserver]: Analyzing ICFG realloc1_false-valid-deref.c [2018-12-09 15:31:46,243 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:31:46,247 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-09 15:31:46,257 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-09 15:31:46,273 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:31:46,273 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 15:31:46,273 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:31:46,273 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:31:46,273 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:31:46,274 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:31:46,274 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:31:46,274 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:31:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-09 15:31:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 15:31:46,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:46,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:46,290 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:46,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1411581223, now seen corresponding path program 1 times [2018-12-09 15:31:46,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:46,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:31:46,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:31:46,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:31:46,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:31:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:31:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:31:46,397 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-12-09 15:31:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:46,420 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-12-09 15:31:46,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:31:46,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-09 15:31:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:46,426 INFO L225 Difference]: With dead ends: 37 [2018-12-09 15:31:46,427 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 15:31:46,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:31:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 15:31:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-12-09 15:31:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 15:31:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-09 15:31:46,448 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 8 [2018-12-09 15:31:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:46,448 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-09 15:31:46,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:31:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-09 15:31:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 15:31:46,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:46,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:46,449 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:46,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1411581277, now seen corresponding path program 1 times [2018-12-09 15:31:46,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:46,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:46,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:46,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:31:46,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:31:46,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:31:46,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:31:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:31:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:31:46,480 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 3 states. [2018-12-09 15:31:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:46,501 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-09 15:31:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:31:46,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-09 15:31:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:46,502 INFO L225 Difference]: With dead ends: 30 [2018-12-09 15:31:46,502 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 15:31:46,503 INFO L631 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 [2018-12-09 15:31:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 15:31:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-12-09 15:31:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 15:31:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-09 15:31:46,505 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2018-12-09 15:31:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:46,505 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-09 15:31:46,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:31:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-09 15:31:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 15:31:46,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:46,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:46,506 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:46,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1411581278, now seen corresponding path program 1 times [2018-12-09 15:31:46,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:46,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:46,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:46,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:31:46,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:31:46,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:31:46,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:31:46,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:31:46,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:31:46,540 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2018-12-09 15:31:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:46,560 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-12-09 15:31:46,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:31:46,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-09 15:31:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:46,561 INFO L225 Difference]: With dead ends: 30 [2018-12-09 15:31:46,561 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 15:31:46,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:31:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 15:31:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-09 15:31:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 15:31:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-09 15:31:46,563 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 8 [2018-12-09 15:31:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:46,564 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-09 15:31:46,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:31:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-09 15:31:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 15:31:46,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:46,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:46,564 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:46,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash -701279318, now seen corresponding path program 1 times [2018-12-09 15:31:46,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:46,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:46,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 15:31:46,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:31:46,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:31:46,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:31:46,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:31:46,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:31:46,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:31:46,582 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 3 states. [2018-12-09 15:31:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:46,589 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-09 15:31:46,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:31:46,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 15:31:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:46,590 INFO L225 Difference]: With dead ends: 30 [2018-12-09 15:31:46,590 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 15:31:46,590 INFO L631 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 [2018-12-09 15:31:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 15:31:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-12-09 15:31:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 15:31:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-09 15:31:46,592 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 12 [2018-12-09 15:31:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:46,592 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-09 15:31:46,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:31:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-09 15:31:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 15:31:46,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:46,593 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:46,593 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:46,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash -701279263, now seen corresponding path program 1 times [2018-12-09 15:31:46,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:46,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:46,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:46,643 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-09 15:31:46,644 INFO L205 CegarAbsIntRunner]: [5], [6], [10], [18], [19], [21], [22], [24], [46], [47], [48] [2018-12-09 15:31:46,664 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:31:46,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:31:46,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:31:46,768 INFO L272 AbstractInterpreter]: Visited 11 different actions 21 times. Merged at 5 different actions 10 times. Never widened. Performed 125 root evaluator evaluations with a maximum evaluation depth of 3. Performed 125 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-12-09 15:31:46,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:46,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:31:46,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:46,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:46,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:46,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:31:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:46,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:46,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 15:31:46,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:46,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:46,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-09 15:31:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:46,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:46,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:46,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-09 15:31:46,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:46,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:31:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:31:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:31:46,927 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-12-09 15:31:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:46,966 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-09 15:31:46,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:31:46,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-09 15:31:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:46,967 INFO L225 Difference]: With dead ends: 31 [2018-12-09 15:31:46,967 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 15:31:46,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:31:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 15:31:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-12-09 15:31:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 15:31:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-09 15:31:46,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2018-12-09 15:31:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:46,969 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-09 15:31:46,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:31:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-09 15:31:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 15:31:46,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:46,970 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:46,970 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:46,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash 77281552, now seen corresponding path program 1 times [2018-12-09 15:31:46,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:46,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:46,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:46,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:47,008 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-09 15:31:47,008 INFO L205 CegarAbsIntRunner]: [5], [6], [10], [16], [18], [19], [22], [24], [29], [31], [33], [46], [47], [48] [2018-12-09 15:31:47,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:31:47,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:31:47,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:31:47,042 INFO L272 AbstractInterpreter]: Visited 14 different actions 29 times. Merged at 4 different actions 12 times. Never widened. Performed 156 root evaluator evaluations with a maximum evaluation depth of 3. Performed 156 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-12-09 15:31:47,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:47,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:31:47,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:47,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:31:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:47,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:47,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-12-09 15:31:47,137 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:47,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:31:47,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:31:47,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:31:47,138 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-12-09 15:31:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:47,153 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-12-09 15:31:47,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:31:47,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 15:31:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:47,154 INFO L225 Difference]: With dead ends: 35 [2018-12-09 15:31:47,154 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 15:31:47,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:31:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 15:31:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-09 15:31:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 15:31:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-09 15:31:47,157 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2018-12-09 15:31:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:47,157 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-09 15:31:47,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:31:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-09 15:31:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 15:31:47,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:47,158 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:47,158 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:47,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash 304709587, now seen corresponding path program 2 times [2018-12-09 15:31:47,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:47,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:47,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:47,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:31:47,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:31:47,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:47,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:31:47,205 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 15:31:47,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 15:31:47,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:31:47,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:47,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-12-09 15:31:47,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:47,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:31:47,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:31:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:31:47,312 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2018-12-09 15:31:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:47,335 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-12-09 15:31:47,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:31:47,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-09 15:31:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:47,336 INFO L225 Difference]: With dead ends: 39 [2018-12-09 15:31:47,336 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 15:31:47,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:31:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 15:31:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-12-09 15:31:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 15:31:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-09 15:31:47,339 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2018-12-09 15:31:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:47,339 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-09 15:31:47,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:31:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-09 15:31:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 15:31:47,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:47,340 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:47,340 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:47,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1914655466, now seen corresponding path program 3 times [2018-12-09 15:31:47,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:47,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:31:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:47,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:47,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:31:47,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:31:47,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:47,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 15:31:47,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 15:31:47,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 15:31:47,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:31:47,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:47,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2018-12-09 15:31:47,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:47,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 15:31:47,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 15:31:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-09 15:31:47,533 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 12 states. [2018-12-09 15:31:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:47,554 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-12-09 15:31:47,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:31:47,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-12-09 15:31:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:47,555 INFO L225 Difference]: With dead ends: 43 [2018-12-09 15:31:47,555 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 15:31:47,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-09 15:31:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 15:31:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-09 15:31:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 15:31:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-12-09 15:31:47,557 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 26 [2018-12-09 15:31:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:47,558 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-12-09 15:31:47,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 15:31:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-12-09 15:31:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 15:31:47,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:47,558 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:47,558 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:47,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:47,558 INFO L82 PathProgramCache]: Analyzing trace with hash -739671847, now seen corresponding path program 4 times [2018-12-09 15:31:47,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:47,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:31:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:47,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:47,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:31:47,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:31:47,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:47,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:47,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:31:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:47,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:47,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2018-12-09 15:31:47,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:47,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 15:31:47,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 15:31:47,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-09 15:31:47,773 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 14 states. [2018-12-09 15:31:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:47,803 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-09 15:31:47,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:31:47,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-12-09 15:31:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:47,804 INFO L225 Difference]: With dead ends: 47 [2018-12-09 15:31:47,804 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 15:31:47,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-12-09 15:31:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 15:31:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-09 15:31:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 15:31:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-09 15:31:47,806 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2018-12-09 15:31:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:47,806 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-09 15:31:47,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 15:31:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-09 15:31:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:31:47,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:47,807 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:47,807 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:47,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2114763548, now seen corresponding path program 5 times [2018-12-09 15:31:47,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:47,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:47,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:47,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:47,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:47,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:31:47,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:31:47,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:47,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:47,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:31:47,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 15:31:47,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-09 15:31:47,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:31:47,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:47,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:48,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-09 15:31:48,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:48,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 15:31:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 15:31:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-09 15:31:48,061 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 16 states. [2018-12-09 15:31:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:48,089 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-12-09 15:31:48,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:31:48,090 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-12-09 15:31:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:48,090 INFO L225 Difference]: With dead ends: 51 [2018-12-09 15:31:48,090 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 15:31:48,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2018-12-09 15:31:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 15:31:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-12-09 15:31:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 15:31:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-09 15:31:48,093 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 34 [2018-12-09 15:31:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:48,094 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-09 15:31:48,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 15:31:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-09 15:31:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 15:31:48,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:48,094 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:48,095 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:48,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1816978465, now seen corresponding path program 6 times [2018-12-09 15:31:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:48,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:48,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:31:48,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:48,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:48,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:48,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:31:48,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:31:48,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:48,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:48,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 15:31:48,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 15:31:48,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 15:31:48,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:31:48,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:48,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-09 15:31:48,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 15:31:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 15:31:48,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-09 15:31:48,370 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 18 states. [2018-12-09 15:31:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:48,401 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-12-09 15:31:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:31:48,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-12-09 15:31:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:48,402 INFO L225 Difference]: With dead ends: 55 [2018-12-09 15:31:48,402 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 15:31:48,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=218, Unknown=0, NotChecked=0, Total=380 [2018-12-09 15:31:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 15:31:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-12-09 15:31:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 15:31:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-09 15:31:48,406 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 38 [2018-12-09 15:31:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:48,406 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-09 15:31:48,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 15:31:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-09 15:31:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 15:31:48,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:48,407 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:48,407 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:48,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1176149214, now seen corresponding path program 7 times [2018-12-09 15:31:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:48,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:48,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:31:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:48,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:48,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:48,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:31:48,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:31:48,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:48,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:48,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:48,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:31:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:48,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:48,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-09 15:31:48,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:48,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 15:31:48,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 15:31:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-09 15:31:48,676 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 20 states. [2018-12-09 15:31:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:48,699 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-09 15:31:48,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:31:48,700 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-12-09 15:31:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:48,700 INFO L225 Difference]: With dead ends: 59 [2018-12-09 15:31:48,700 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 15:31:48,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-09 15:31:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 15:31:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-12-09 15:31:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 15:31:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-09 15:31:48,702 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 42 [2018-12-09 15:31:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:48,703 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-09 15:31:48,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 15:31:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-09 15:31:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 15:31:48,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:48,703 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:48,703 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:48,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1665945829, now seen corresponding path program 8 times [2018-12-09 15:31:48,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:48,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:48,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:48,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:31:48,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:31:48,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:31:48,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:48,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:48,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:31:48,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 15:31:48,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-09 15:31:48,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:31:48,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:31:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:49,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:31:49,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-12-09 15:31:49,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:31:49,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 15:31:49,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 15:31:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-09 15:31:49,045 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 22 states. [2018-12-09 15:31:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:49,072 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-12-09 15:31:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 15:31:49,073 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-12-09 15:31:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:49,073 INFO L225 Difference]: With dead ends: 63 [2018-12-09 15:31:49,073 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 15:31:49,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-12-09 15:31:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 15:31:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-12-09 15:31:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 15:31:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-09 15:31:49,077 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 46 [2018-12-09 15:31:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:49,077 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-09 15:31:49,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 15:31:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-09 15:31:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 15:31:49,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:49,078 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:49,078 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 15:31:49,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:49,078 INFO L82 PathProgramCache]: Analyzing trace with hash 3188008, now seen corresponding path program 9 times [2018-12-09 15:31:49,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:31:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:49,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:31:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:49,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:31:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:31:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:31:49,114 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 15:31:49,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:31:49 BoogieIcfgContainer [2018-12-09 15:31:49,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:31:49,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:31:49,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:31:49,140 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:31:49,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:31:46" (3/4) ... [2018-12-09 15:31:49,142 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 15:31:49,177 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4af2cb8b-1493-47ee-a189-2c65265c179e/bin-2019/utaipan/witness.graphml [2018-12-09 15:31:49,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:31:49,178 INFO L168 Benchmark]: Toolchain (without parser) took 3286.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 957.8 MB in the beginning and 820.5 MB in the end (delta: 137.3 MB). Peak memory consumption was 307.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:31:49,178 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:31:49,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.70 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:31:49,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.13 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:31:49,179 INFO L168 Benchmark]: Boogie Preprocessor took 43.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -108.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:31:49,179 INFO L168 Benchmark]: RCFGBuilder took 155.08 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: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:31:49,179 INFO L168 Benchmark]: TraceAbstraction took 2907.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.9 MB). Free memory was 1.0 GB in the beginning and 820.5 MB in the end (delta: 218.9 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:31:49,180 INFO L168 Benchmark]: Witness Printer took 37.49 ms. Allocated memory is still 1.2 GB. Free memory is still 820.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:31:49,181 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 125.70 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.13 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -108.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 155.08 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: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2907.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.9 MB). Free memory was 1.0 GB in the beginning and 820.5 MB in the end (delta: 218.9 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. * Witness Printer took 37.49 ms. Allocated memory is still 1.2 GB. Free memory is still 820.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) [L16] p[2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 7 error locations. UNSAFE Result, 2.8s OverallTime, 14 OverallIterations, 10 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 294 SDtfs, 327 SDslu, 512 SDs, 0 SdLazy, 355 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 617 GetRequests, 439 SyntacticMatches, 39 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 40 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 622 NumberOfCodeBlocks, 622 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 103235 SizeOfPredicates, 11 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 2/1579 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...