./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0158_1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0158_1-3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2222db53b1ba3adad8f3ce16bd4a15f62841c2c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:27:44,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:27:44,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:27:44,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:27:44,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:27:44,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:27:44,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:27:44,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:27:44,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:27:44,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:27:44,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:27:44,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:27:44,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:27:44,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:27:44,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:27:44,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:27:44,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:27:44,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:27:44,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:27:44,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:27:44,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:27:44,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:27:44,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:27:44,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:27:44,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:27:44,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:27:44,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:27:44,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:27:44,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:27:44,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:27:44,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:27:44,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:27:44,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:27:44,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:27:44,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:27:44,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:27:44,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:27:44,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:27:44,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:27:44,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:27:44,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:27:44,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 11:27:44,130 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:27:44,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:27:44,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:27:44,131 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:27:44,131 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:27:44,131 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:27:44,131 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:27:44,131 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:27:44,132 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:27:44,132 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:27:44,132 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:27:44,132 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:27:44,132 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:27:44,132 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:27:44,132 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:27:44,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:27:44,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:27:44,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:27:44,133 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:27:44,133 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:27:44,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:27:44,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:27:44,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:27:44,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:27:44,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:27:44,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:27:44,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:27:44,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:27:44,135 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:27:44,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:27:44,136 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:27:44,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:27:44,136 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2222db53b1ba3adad8f3ce16bd4a15f62841c2c [2019-12-07 11:27:44,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:27:44,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:27:44,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:27:44,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:27:44,251 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:27:44,252 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0158_1-3.i [2019-12-07 11:27:44,293 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/data/cfa42d442/5369203c7e8d42f0bb2933be4ab41e56/FLAG473f2264a [2019-12-07 11:27:44,743 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:27:44,744 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/sv-benchmarks/c/list-ext-properties/test-0158_1-3.i [2019-12-07 11:27:44,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/data/cfa42d442/5369203c7e8d42f0bb2933be4ab41e56/FLAG473f2264a [2019-12-07 11:27:44,761 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/data/cfa42d442/5369203c7e8d42f0bb2933be4ab41e56 [2019-12-07 11:27:44,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:27:44,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:27:44,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:27:44,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:27:44,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:27:44,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:27:44" (1/1) ... [2019-12-07 11:27:44,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dd141f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:44, skipping insertion in model container [2019-12-07 11:27:44,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:27:44" (1/1) ... [2019-12-07 11:27:44,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:27:44,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:27:44,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:27:45,002 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:27:45,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:27:45,064 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:27:45,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45 WrapperNode [2019-12-07 11:27:45,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:27:45,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:27:45,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:27:45,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:27:45,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:27:45,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:27:45,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:27:45,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:27:45,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... [2019-12-07 11:27:45,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:27:45,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:27:45,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:27:45,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:27:45,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:27:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:27:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:27:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:27:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:27:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:27:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:27:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:27:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:27:45,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:27:45,344 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:27:45,344 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 11:27:45,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:27:45 BoogieIcfgContainer [2019-12-07 11:27:45,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:27:45,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:27:45,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:27:45,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:27:45,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:27:44" (1/3) ... [2019-12-07 11:27:45,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2f0edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:27:45, skipping insertion in model container [2019-12-07 11:27:45,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:27:45" (2/3) ... [2019-12-07 11:27:45,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2f0edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:27:45, skipping insertion in model container [2019-12-07 11:27:45,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:27:45" (3/3) ... [2019-12-07 11:27:45,350 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0158_1-3.i [2019-12-07 11:27:45,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:27:45,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-12-07 11:27:45,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-12-07 11:27:45,380 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:27:45,380 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:27:45,380 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:27:45,380 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:27:45,380 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:27:45,380 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:27:45,380 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:27:45,380 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:27:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-12-07 11:27:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:27:45,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:45,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:27:45,395 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:27:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2608, now seen corresponding path program 1 times [2019-12-07 11:27:45,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:27:45,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914978621] [2019-12-07 11:27:45,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:45,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914978621] [2019-12-07 11:27:45,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:45,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:27:45,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860879888] [2019-12-07 11:27:45,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:45,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:27:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:45,523 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-12-07 11:27:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:45,571 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-12-07 11:27:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:45,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:27:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:45,578 INFO L225 Difference]: With dead ends: 32 [2019-12-07 11:27:45,578 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 11:27:45,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 11:27:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 11:27:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 11:27:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-12-07 11:27:45,601 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 2 [2019-12-07 11:27:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:45,601 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-12-07 11:27:45,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-12-07 11:27:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:27:45,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:45,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:27:45,602 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:27:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2609, now seen corresponding path program 1 times [2019-12-07 11:27:45,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:27:45,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466434229] [2019-12-07 11:27:45,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:45,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466434229] [2019-12-07 11:27:45,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:45,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:27:45,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725281989] [2019-12-07 11:27:45,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:27:45,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:27:45,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:27:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:45,631 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 3 states. [2019-12-07 11:27:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:45,652 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-12-07 11:27:45,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:27:45,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:27:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:45,652 INFO L225 Difference]: With dead ends: 24 [2019-12-07 11:27:45,652 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 11:27:45,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:27:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 11:27:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 11:27:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 11:27:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-12-07 11:27:45,657 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 2 [2019-12-07 11:27:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:45,657 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-12-07 11:27:45,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:27:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-12-07 11:27:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:27:45,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:45,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:45,658 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:27:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:45,658 INFO L82 PathProgramCache]: Analyzing trace with hash 615708885, now seen corresponding path program 1 times [2019-12-07 11:27:45,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:27:45,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136727273] [2019-12-07 11:27:45,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:45,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136727273] [2019-12-07 11:27:45,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:45,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:45,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362613685] [2019-12-07 11:27:45,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:27:45,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:27:45,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:27:45,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:27:45,714 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2019-12-07 11:27:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:45,756 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-12-07 11:27:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:27:45,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:27:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:45,757 INFO L225 Difference]: With dead ends: 23 [2019-12-07 11:27:45,757 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 11:27:45,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:27:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 11:27:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 11:27:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:27:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 11:27:45,760 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 9 [2019-12-07 11:27:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:45,760 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 11:27:45,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:27:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 11:27:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:27:45,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:45,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:45,761 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:27:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1907106321, now seen corresponding path program 1 times [2019-12-07 11:27:45,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:27:45,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381186286] [2019-12-07 11:27:45,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:45,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381186286] [2019-12-07 11:27:45,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:45,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:45,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011035724] [2019-12-07 11:27:45,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:27:45,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:27:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:27:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:27:45,806 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2019-12-07 11:27:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:45,850 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-12-07 11:27:45,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:27:45,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 11:27:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:45,851 INFO L225 Difference]: With dead ends: 22 [2019-12-07 11:27:45,851 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 11:27:45,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:27:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 11:27:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 11:27:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 11:27:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-12-07 11:27:45,855 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2019-12-07 11:27:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:45,855 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-12-07 11:27:45,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:27:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-12-07 11:27:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:27:45,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:45,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:45,856 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:27:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:45,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1009246121, now seen corresponding path program 1 times [2019-12-07 11:27:45,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:27:45,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545758798] [2019-12-07 11:27:45,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:45,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545758798] [2019-12-07 11:27:45,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:45,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:45,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967943270] [2019-12-07 11:27:45,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:27:45,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:27:45,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:27:45,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:27:45,900 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2019-12-07 11:27:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:45,940 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 11:27:45,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:27:45,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 11:27:45,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:45,941 INFO L225 Difference]: With dead ends: 21 [2019-12-07 11:27:45,941 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 11:27:45,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:27:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 11:27:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 11:27:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 11:27:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 11:27:45,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 11 [2019-12-07 11:27:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:45,944 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 11:27:45,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:27:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-12-07 11:27:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:27:45,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:45,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:45,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:27:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1221858605, now seen corresponding path program 1 times [2019-12-07 11:27:45,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:27:45,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349553624] [2019-12-07 11:27:45,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:45,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349553624] [2019-12-07 11:27:45,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:45,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:45,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134875445] [2019-12-07 11:27:45,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:27:45,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:27:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:27:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:27:45,982 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-12-07 11:27:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:46,018 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-12-07 11:27:46,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:27:46,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 11:27:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:46,019 INFO L225 Difference]: With dead ends: 20 [2019-12-07 11:27:46,019 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 11:27:46,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:27:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 11:27:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 11:27:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:27:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 11:27:46,021 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2019-12-07 11:27:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:46,022 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 11:27:46,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:27:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 11:27:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:27:46,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:46,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:46,022 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:27:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:46,023 INFO L82 PathProgramCache]: Analyzing trace with hash 777088985, now seen corresponding path program 1 times [2019-12-07 11:27:46,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:27:46,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667822137] [2019-12-07 11:27:46,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:27:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:27:46,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667822137] [2019-12-07 11:27:46,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:27:46,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:27:46,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040016683] [2019-12-07 11:27:46,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:27:46,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:27:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:27:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:27:46,055 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-12-07 11:27:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:27:46,092 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-12-07 11:27:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:27:46,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 11:27:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:27:46,092 INFO L225 Difference]: With dead ends: 19 [2019-12-07 11:27:46,093 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 11:27:46,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:27:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 11:27:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 11:27:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 11:27:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-12-07 11:27:46,095 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2019-12-07 11:27:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:27:46,096 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 11:27:46,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:27:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-12-07 11:27:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:27:46,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:27:46,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:27:46,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:27:46,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:27:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1680045163, now seen corresponding path program 1 times [2019-12-07 11:27:46,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:27:46,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996357651] [2019-12-07 11:27:46,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:27:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:27:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:27:46,142 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:27:46,142 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:27:46,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:27:46 BoogieIcfgContainer [2019-12-07 11:27:46,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:27:46,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:27:46,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:27:46,163 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:27:46,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:27:45" (3/4) ... [2019-12-07 11:27:46,165 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:27:46,194 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c9c95a3f-6e85-4b25-8ce6-a75ab2436974/bin/utaipan/witness.graphml [2019-12-07 11:27:46,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:27:46,196 INFO L168 Benchmark]: Toolchain (without parser) took 1431.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 942.3 MB in the beginning and 938.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:46,196 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:27:46,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:46,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:27:46,197 INFO L168 Benchmark]: Boogie Preprocessor took 16.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:27:46,197 INFO L168 Benchmark]: RCFGBuilder took 234.97 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:46,198 INFO L168 Benchmark]: TraceAbstraction took 816.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 938.6 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:27:46,198 INFO L168 Benchmark]: Witness Printer took 31.69 ms. Allocated memory is still 1.1 GB. Free memory is still 938.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:27:46,199 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 234.97 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 816.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 938.6 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * Witness Printer took 31.69 ms. Allocated memory is still 1.1 GB. Free memory is still 938.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 534]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L515-L522] union { void *p0; struct { char c[2]; int p1; int p2; } str; } data; [L523] data.p0 = malloc(37U) [L524] EXPR data.p0 [L524] void *ptr = data.p0; [L525] COND FALSE !(__VERIFIER_nondet_int()) [L528] data.str.p2 = 30 [L530] EXPR data.str.p2 [L530] COND FALSE !(25 > data.str.p2) [L533] EXPR data.p0 [L533] free(data.p0) [L533] free(data.p0) [L533] free(data.p0) [L534] free(ptr) [L534] free(ptr) [L534] free(ptr) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 21 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 93 SDtfs, 196 SDslu, 43 SDs, 0 SdLazy, 133 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 2934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...