./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/lis_unsafe_false-valid-deref.i --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_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/lis_unsafe_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/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 5b50a1ee99e08fd261bb9e6273225454d92c8178 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 00:20:22,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:20:22,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:20:22,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:20:22,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:20:22,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:20:22,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:20:22,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:20:22,209 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:20:22,210 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:20:22,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:20:22,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:20:22,211 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:20:22,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:20:22,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:20:22,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:20:22,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:20:22,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:20:22,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:20:22,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:20:22,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:20:22,215 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:20:22,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:20:22,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:20:22,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:20:22,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:20:22,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:20:22,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:20:22,218 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:20:22,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:20:22,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:20:22,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:20:22,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:20:22,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:20:22,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:20:22,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:20:22,220 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 00:20:22,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:20:22,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:20:22,228 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:20:22,228 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:20:22,228 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:20:22,228 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:20:22,228 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:20:22,228 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:20:22,228 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:20:22,228 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:20:22,228 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:20:22,228 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:20:22,229 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:20:22,229 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:20:22,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:20:22,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:20:22,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:20:22,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:20:22,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:20:22,229 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:20:22,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:20:22,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:20:22,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:20:22,231 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:20:22,231 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:20:22,231 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:20:22,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:20:22,231 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_70e02fff-1819-4463-b7d2-a6b3066d4441/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 -> 5b50a1ee99e08fd261bb9e6273225454d92c8178 [2018-12-09 00:20:22,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:20:22,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:20:22,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:20:22,257 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:20:22,257 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:20:22,257 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/lis_unsafe_false-valid-deref.i [2018-12-09 00:20:22,294 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/data/9f95422e2/16b740fd07c340d2b360571b40a94da9/FLAGb1a98b4ad [2018-12-09 00:20:22,685 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:20:22,685 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/sv-benchmarks/c/array-memsafety/lis_unsafe_false-valid-deref.i [2018-12-09 00:20:22,691 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/data/9f95422e2/16b740fd07c340d2b360571b40a94da9/FLAGb1a98b4ad [2018-12-09 00:20:22,699 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/data/9f95422e2/16b740fd07c340d2b360571b40a94da9 [2018-12-09 00:20:22,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:20:22,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:20:22,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:20:22,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:20:22,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:20:22,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23455ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22, skipping insertion in model container [2018-12-09 00:20:22,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:20:22,728 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:20:22,868 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:20:22,874 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:20:22,937 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:20:22,957 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:20:22,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22 WrapperNode [2018-12-09 00:20:22,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:20:22,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:20:22,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:20:22,958 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:20:22,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:20:22,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:20:22,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:20:22,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:20:22,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... [2018-12-09 00:20:22,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:20:22,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:20:22,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:20:22,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:20:22,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/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 00:20:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:20:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:20:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:20:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:20:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:20:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:20:23,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:20:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure lis [2018-12-09 00:20:23,026 INFO L138 BoogieDeclarations]: Found implementation of procedure lis [2018-12-09 00:20:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:20:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:20:23,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:20:23,227 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:20:23,227 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 00:20:23,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:20:23 BoogieIcfgContainer [2018-12-09 00:20:23,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:20:23,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:20:23,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:20:23,230 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:20:23,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:20:22" (1/3) ... [2018-12-09 00:20:23,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d66769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:20:23, skipping insertion in model container [2018-12-09 00:20:23,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:20:22" (2/3) ... [2018-12-09 00:20:23,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d66769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:20:23, skipping insertion in model container [2018-12-09 00:20:23,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:20:23" (3/3) ... [2018-12-09 00:20:23,232 INFO L112 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-12-09 00:20:23,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:20:23,245 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-12-09 00:20:23,254 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-12-09 00:20:23,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:20:23,270 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 00:20:23,270 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:20:23,270 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:20:23,270 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:20:23,270 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:20:23,270 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:20:23,270 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:20:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-12-09 00:20:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:20:23,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:23,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:23,287 INFO L423 AbstractCegarLoop]: === Iteration 1 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:23,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1483964060, now seen corresponding path program 1 times [2018-12-09 00:20:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:23,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:23,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:23,394 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 00:20:23,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:20:23,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:20:23,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:20:23,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:20:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:20:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:20:23,407 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2018-12-09 00:20:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:23,459 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-12-09 00:20:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:20:23,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 00:20:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:23,466 INFO L225 Difference]: With dead ends: 66 [2018-12-09 00:20:23,466 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 00:20:23,467 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 00:20:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 00:20:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 00:20:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 00:20:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-09 00:20:23,489 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 10 [2018-12-09 00:20:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:23,490 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-09 00:20:23,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:20:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-09 00:20:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:20:23,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:23,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:23,490 INFO L423 AbstractCegarLoop]: === Iteration 2 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:23,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1483964061, now seen corresponding path program 1 times [2018-12-09 00:20:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:23,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:23,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:23,543 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 00:20:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:20:23,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:20:23,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:20:23,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:20:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:20:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:20:23,545 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 4 states. [2018-12-09 00:20:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:23,622 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-12-09 00:20:23,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:20:23,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 00:20:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:23,623 INFO L225 Difference]: With dead ends: 70 [2018-12-09 00:20:23,623 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 00:20:23,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:20:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 00:20:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2018-12-09 00:20:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:20:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-12-09 00:20:23,628 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 10 [2018-12-09 00:20:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:23,628 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-12-09 00:20:23,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:20:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-12-09 00:20:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:20:23,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:23,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:23,629 INFO L423 AbstractCegarLoop]: === Iteration 3 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:23,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:23,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1241754411, now seen corresponding path program 1 times [2018-12-09 00:20:23,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:23,667 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 00:20:23,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:20:23,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:20:23,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:20:23,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:20:23,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:20:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:20:23,668 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 5 states. [2018-12-09 00:20:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:23,746 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-12-09 00:20:23,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:20:23,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-09 00:20:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:23,747 INFO L225 Difference]: With dead ends: 79 [2018-12-09 00:20:23,747 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 00:20:23,747 INFO L631 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 [2018-12-09 00:20:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 00:20:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2018-12-09 00:20:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 00:20:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-09 00:20:23,750 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 11 [2018-12-09 00:20:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:23,750 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-09 00:20:23,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:20:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-09 00:20:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:20:23,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:23,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:23,751 INFO L423 AbstractCegarLoop]: === Iteration 4 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:23,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:23,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1241754412, now seen corresponding path program 1 times [2018-12-09 00:20:23,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:23,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:23,768 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 00:20:23,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:20:23,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:20:23,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:20:23,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:20:23,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:20:23,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:20:23,769 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 3 states. [2018-12-09 00:20:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:23,785 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-12-09 00:20:23,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:20:23,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 00:20:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:23,786 INFO L225 Difference]: With dead ends: 59 [2018-12-09 00:20:23,787 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 00:20:23,787 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 00:20:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 00:20:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-09 00:20:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 00:20:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-12-09 00:20:23,791 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 11 [2018-12-09 00:20:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:23,791 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-12-09 00:20:23,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:20:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-12-09 00:20:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 00:20:23,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:23,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:23,792 INFO L423 AbstractCegarLoop]: === Iteration 5 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:23,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash 673414648, now seen corresponding path program 1 times [2018-12-09 00:20:23,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:23,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:23,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:23,825 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 00:20:23,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:20:23,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:20:23,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:20:23,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:20:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:20:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:20:23,826 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 5 states. [2018-12-09 00:20:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:23,893 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-12-09 00:20:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:20:23,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 00:20:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:23,895 INFO L225 Difference]: With dead ends: 82 [2018-12-09 00:20:23,895 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 00:20:23,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:20:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 00:20:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2018-12-09 00:20:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:20:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-12-09 00:20:23,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 13 [2018-12-09 00:20:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:23,899 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-12-09 00:20:23,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:20:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-12-09 00:20:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 00:20:23,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:23,900 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:23,900 INFO L423 AbstractCegarLoop]: === Iteration 6 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:23,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:23,900 INFO L82 PathProgramCache]: Analyzing trace with hash -552379614, now seen corresponding path program 1 times [2018-12-09 00:20:23,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:23,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:23,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:23,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:23,957 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 00:20:23,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:20:23,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:20:23,958 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-09 00:20:23,959 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [13], [14], [18], [121], [126], [127], [128], [130] [2018-12-09 00:20:23,978 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:20:23,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:20:24,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:20:24,105 INFO L272 AbstractInterpreter]: Visited 13 different actions 33 times. Merged at 5 different actions 20 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 00:20:24,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:24,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:20:24,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:20:24,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/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 00:20:24,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:24,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:20:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:24,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:20:24,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 00:20:24,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-12-09 00:20:24,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:20:24,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:20:24,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 00:20:24,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:20:24,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:20:24,195 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 [2018-12-09 00:20:24,249 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 00:20:24,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:20:24,308 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 00:20:24,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:20:24,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-12-09 00:20:24,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:20:24,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:20:24,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:20:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:20:24,324 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 9 states. [2018-12-09 00:20:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:24,461 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-12-09 00:20:24,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:20:24,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-12-09 00:20:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:24,461 INFO L225 Difference]: With dead ends: 77 [2018-12-09 00:20:24,462 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 00:20:24,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:20:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 00:20:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-12-09 00:20:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:20:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-12-09 00:20:24,465 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 14 [2018-12-09 00:20:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:24,465 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-12-09 00:20:24,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:20:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-12-09 00:20:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:20:24,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:24,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:24,466 INFO L423 AbstractCegarLoop]: === Iteration 7 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:24,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:24,466 INFO L82 PathProgramCache]: Analyzing trace with hash 866620061, now seen corresponding path program 1 times [2018-12-09 00:20:24,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:24,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:24,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:24,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:24,488 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 00:20:24,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:20:24,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:20:24,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:20:24,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:20:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:20:24,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:20:24,489 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 4 states. [2018-12-09 00:20:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:24,520 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-12-09 00:20:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:20:24,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-09 00:20:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:24,521 INFO L225 Difference]: With dead ends: 64 [2018-12-09 00:20:24,521 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 00:20:24,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:20:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 00:20:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-09 00:20:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 00:20:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-12-09 00:20:24,523 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2018-12-09 00:20:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:24,524 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-12-09 00:20:24,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:20:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-12-09 00:20:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:20:24,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:24,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:24,524 INFO L423 AbstractCegarLoop]: === Iteration 8 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:24,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1922918573, now seen corresponding path program 1 times [2018-12-09 00:20:24,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:24,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:24,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:20:24,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:20:24,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:20:24,554 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-09 00:20:24,554 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [14], [18], [22], [30], [38], [40], [121], [126], [127], [128], [130] [2018-12-09 00:20:24,555 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:20:24,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:20:24,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:20:24,589 INFO L272 AbstractInterpreter]: Visited 17 different actions 35 times. Merged at 5 different actions 15 times. Widened at 1 different actions 1 times. Performed 234 root evaluator evaluations with a maximum evaluation depth of 4. Performed 234 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 00:20:24,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:24,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:20:24,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:20:24,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/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 00:20:24,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:24,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:20:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:24,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:20:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:20:24,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:20:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:20:24,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:20:24,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-09 00:20:24,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:20:24,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:20:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:20:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:20:24,658 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 8 states. [2018-12-09 00:20:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:24,745 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2018-12-09 00:20:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:20:24,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-09 00:20:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:24,746 INFO L225 Difference]: With dead ends: 130 [2018-12-09 00:20:24,746 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 00:20:24,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:20:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 00:20:24,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 76. [2018-12-09 00:20:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 00:20:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-12-09 00:20:24,751 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 17 [2018-12-09 00:20:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:24,751 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-12-09 00:20:24,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:20:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-12-09 00:20:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:20:24,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:24,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:24,752 INFO L423 AbstractCegarLoop]: === Iteration 9 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:24,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash 519051719, now seen corresponding path program 1 times [2018-12-09 00:20:24,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:24,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:24,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:24,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:24,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:20:24,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:20:24,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:20:24,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:20:24,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:20:24,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:20:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:20:24,809 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 8 states. [2018-12-09 00:20:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:24,899 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-12-09 00:20:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:20:24,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 00:20:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:24,900 INFO L225 Difference]: With dead ends: 83 [2018-12-09 00:20:24,900 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 00:20:24,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:20:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 00:20:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-12-09 00:20:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 00:20:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2018-12-09 00:20:24,902 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 18 [2018-12-09 00:20:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:24,903 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2018-12-09 00:20:24,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:20:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-12-09 00:20:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:20:24,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:24,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:24,903 INFO L423 AbstractCegarLoop]: === Iteration 10 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:24,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash 444087854, now seen corresponding path program 1 times [2018-12-09 00:20:24,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:24,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:24,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:24,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:24,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:20:25,020 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 00:20:25,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:20:25,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:20:25,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:20:25,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:20:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:20:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:20:25,021 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 5 states. [2018-12-09 00:20:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:20:25,116 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-12-09 00:20:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:20:25,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 00:20:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:20:25,117 INFO L225 Difference]: With dead ends: 69 [2018-12-09 00:20:25,117 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 00:20:25,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:20:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 00:20:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-09 00:20:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 00:20:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-09 00:20:25,119 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 21 [2018-12-09 00:20:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:20:25,119 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-09 00:20:25,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:20:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-09 00:20:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:20:25,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:20:25,120 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:20:25,120 INFO L423 AbstractCegarLoop]: === Iteration 11 === [lisErr24ASSERT_VIOLATIONMEMORY_FREE, lisErr5REQUIRES_VIOLATION, lisErr4REQUIRES_VIOLATION, lisErr3REQUIRES_VIOLATION, lisErr2REQUIRES_VIOLATION, lisErr23ASSERT_VIOLATIONMEMORY_FREE, lisErr1REQUIRES_VIOLATION, lisErr11REQUIRES_VIOLATION, lisErr10REQUIRES_VIOLATION, lisErr9REQUIRES_VIOLATION, lisErr8REQUIRES_VIOLATION, lisErr7REQUIRES_VIOLATION, lisErr6REQUIRES_VIOLATION, lisErr16REQUIRES_VIOLATION, lisErr25ASSERT_VIOLATIONMEMORY_FREE, lisErr15REQUIRES_VIOLATION, lisErr14REQUIRES_VIOLATION, lisErr13REQUIRES_VIOLATION, lisErr12REQUIRES_VIOLATION, lisErr22ASSERT_VIOLATIONMEMORY_FREE, lisErr0REQUIRES_VIOLATION, lisErr21REQUIRES_VIOLATION, lisErr20REQUIRES_VIOLATION, lisErr19REQUIRES_VIOLATION, lisErr18REQUIRES_VIOLATION, lisErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 00:20:25,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:20:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1603302610, now seen corresponding path program 2 times [2018-12-09 00:20:25,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:20:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:25,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:20:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:20:25,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:20:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:20:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:20:25,143 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:20:25,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:20:25 BoogieIcfgContainer [2018-12-09 00:20:25,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:20:25,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:20:25,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:20:25,164 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:20:25,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:20:23" (3/4) ... [2018-12-09 00:20:25,166 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:20:25,194 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_70e02fff-1819-4463-b7d2-a6b3066d4441/bin-2019/utaipan/witness.graphml [2018-12-09 00:20:25,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:20:25,195 INFO L168 Benchmark]: Toolchain (without parser) took 2493.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 948.1 MB in the beginning and 941.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:20:25,196 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:20:25,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:20:25,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:20:25,196 INFO L168 Benchmark]: Boogie Preprocessor took 17.38 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. [2018-12-09 00:20:25,197 INFO L168 Benchmark]: RCFGBuilder took 233.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:20:25,197 INFO L168 Benchmark]: TraceAbstraction took 1935.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 945.3 MB in the end (delta: 121.1 MB). Peak memory consumption was 121.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:20:25,197 INFO L168 Benchmark]: Witness Printer took 30.25 ms. Allocated memory is still 1.1 GB. Free memory was 945.3 MB in the beginning and 941.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:20:25,198 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.38 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 233.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1935.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 945.3 MB in the end (delta: 121.1 MB). Peak memory consumption was 121.1 MB. Max. memory is 11.5 GB. * Witness Printer took 30.25 ms. Allocated memory is still 1.1 GB. Free memory was 945.3 MB in the beginning and 941.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 549]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) VAL [\old(N)=2, a={10:11}] [L542] int *best, *prev, i, j, max = 0; [L543] best = (int*) malloc(sizeof(int) * N) [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=0, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=0, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L546] best[i] = 1 VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=0, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L546] prev[i] = i VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=0, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L545] i++ VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=1, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=1, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L546] best[i] = 1 VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=1, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L546] prev[i] = i VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=1, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L545] i++ VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=2, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=2, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L547] i = 1 VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=1, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L547] COND TRUE i < N [L548] j = 0 VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=1, j=0, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L548] COND TRUE j < i VAL [\old(N)=2, a={10:11}, a={10:11}, best={15:0}, i=1, j=0, malloc(sizeof(int) * N)={15:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={12:0}] [L549] a[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 27 error locations. UNSAFE Result, 1.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 437 SDtfs, 727 SDslu, 611 SDs, 0 SdLazy, 801 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=8, 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, 10 MinimizatonAttempts, 120 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 190 ConstructedInterpolants, 10 QuantifiedInterpolants, 22020 SizeOfPredicates, 11 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 3/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...