./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/960521-1_1_false-valid-free.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_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/960521-1_1_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/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 0aa8863ece82a1c5b6b3bdfef0291d9b5e9dd95e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:39:35,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:39:35,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:39:35,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:39:35,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:39:35,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:39:35,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:39:35,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:39:35,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:39:35,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:39:35,544 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:39:35,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:39:35,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:39:35,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:39:35,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:39:35,546 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:39:35,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:39:35,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:39:35,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:39:35,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:39:35,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:39:35,550 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:39:35,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:39:35,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:39:35,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:39:35,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:39:35,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:39:35,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:39:35,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:39:35,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:39:35,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:39:35,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:39:35,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:39:35,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:39:35,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:39:35,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:39:35,556 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 01:39:35,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:39:35,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:39:35,564 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:39:35,564 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:39:35,564 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:39:35,564 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:39:35,564 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:39:35,565 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 01:39:35,565 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:39:35,565 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:39:35,565 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 01:39:35,565 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 01:39:35,565 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:39:35,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:39:35,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:39:35,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:39:35,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:39:35,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:39:35,567 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:39:35,567 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:39:35,567 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:39:35,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:39:35,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:39:35,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:39:35,567 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 01:39:35,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:39:35,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:39:35,567 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_71b6459f-2a4f-463a-b6d5-6a610797569f/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 -> 0aa8863ece82a1c5b6b3bdfef0291d9b5e9dd95e [2018-12-09 01:39:35,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:39:35,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:39:35,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:39:35,598 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:39:35,598 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:39:35,599 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/../../sv-benchmarks/c/list-ext-properties/960521-1_1_false-valid-free.i [2018-12-09 01:39:35,643 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/data/c4e0f7adb/10b3cd1ded8b47118f6fb195c7f694fb/FLAGf10866a5b [2018-12-09 01:39:35,984 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:39:35,985 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/sv-benchmarks/c/list-ext-properties/960521-1_1_false-valid-free.i [2018-12-09 01:39:35,990 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/data/c4e0f7adb/10b3cd1ded8b47118f6fb195c7f694fb/FLAGf10866a5b [2018-12-09 01:39:35,998 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/data/c4e0f7adb/10b3cd1ded8b47118f6fb195c7f694fb [2018-12-09 01:39:36,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:39:36,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:39:36,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:39:36,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:39:36,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:39:36,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:39:35" (1/1) ... [2018-12-09 01:39:36,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2780a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36, skipping insertion in model container [2018-12-09 01:39:36,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:39:35" (1/1) ... [2018-12-09 01:39:36,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:39:36,034 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:39:36,186 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:39:36,191 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:39:36,250 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:39:36,278 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:39:36,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36 WrapperNode [2018-12-09 01:39:36,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:39:36,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:39:36,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:39:36,279 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:39:36,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:39:36,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:39:36,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:39:36,297 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:39:36,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... [2018-12-09 01:39:36,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:39:36,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:39:36,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:39:36,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:39:36,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/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 01:39:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:39:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:39:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:39:36,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:39:36,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:39:36,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:39:36,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:39:36,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:39:36,346 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-12-09 01:39:36,346 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-12-09 01:39:36,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:39:36,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:39:36,496 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:39:36,497 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 01:39:36,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:39:36 BoogieIcfgContainer [2018-12-09 01:39:36,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:39:36,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:39:36,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:39:36,500 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:39:36,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:39:35" (1/3) ... [2018-12-09 01:39:36,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6024f620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:39:36, skipping insertion in model container [2018-12-09 01:39:36,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:39:36" (2/3) ... [2018-12-09 01:39:36,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6024f620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:39:36, skipping insertion in model container [2018-12-09 01:39:36,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:39:36" (3/3) ... [2018-12-09 01:39:36,502 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-12-09 01:39:36,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:39:36,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-12-09 01:39:36,521 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-12-09 01:39:36,537 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:39:36,537 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:39:36,537 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:39:36,537 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:39:36,537 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:39:36,537 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:39:36,537 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:39:36,538 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:39:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-09 01:39:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 01:39:36,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:36,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:39:36,556 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:36,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1113825241, now seen corresponding path program 1 times [2018-12-09 01:39:36,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:36,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:36,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:36,639 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 01:39:36,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:39:36,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:39:36,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:36,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 01:39:36,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 01:39:36,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 01:39:36,653 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-09 01:39:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:36,664 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-09 01:39:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 01:39:36,665 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-09 01:39:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:36,671 INFO L225 Difference]: With dead ends: 54 [2018-12-09 01:39:36,671 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 01:39:36,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 01:39:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 01:39:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-09 01:39:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 01:39:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-12-09 01:39:36,693 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 9 [2018-12-09 01:39:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:36,694 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-12-09 01:39:36,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 01:39:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-12-09 01:39:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:39:36,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:36,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:39:36,695 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:36,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash -169058412, now seen corresponding path program 1 times [2018-12-09 01:39:36,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:36,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:36,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:36,736 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 01:39:36,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:39:36,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:39:36,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:36,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:39:36,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:39:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:39:36,738 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 3 states. [2018-12-09 01:39:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:36,774 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-12-09 01:39:36,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:39:36,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 01:39:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:36,775 INFO L225 Difference]: With dead ends: 50 [2018-12-09 01:39:36,775 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 01:39:36,775 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 01:39:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 01:39:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-09 01:39:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 01:39:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-12-09 01:39:36,779 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 10 [2018-12-09 01:39:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:36,779 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-12-09 01:39:36,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:39:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-12-09 01:39:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:39:36,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:36,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:39:36,780 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:36,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:36,780 INFO L82 PathProgramCache]: Analyzing trace with hash -169058411, now seen corresponding path program 1 times [2018-12-09 01:39:36,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:36,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:36,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:36,821 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 01:39:36,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:39:36,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:39:36,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:36,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:39:36,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:39:36,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:39:36,823 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-12-09 01:39:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:36,853 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-09 01:39:36,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:39:36,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 01:39:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:36,854 INFO L225 Difference]: With dead ends: 49 [2018-12-09 01:39:36,854 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 01:39:36,854 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 01:39:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 01:39:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-09 01:39:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 01:39:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-12-09 01:39:36,857 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 10 [2018-12-09 01:39:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:36,857 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-12-09 01:39:36,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:39:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-12-09 01:39:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:39:36,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:36,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:39:36,858 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:36,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:36,858 INFO L82 PathProgramCache]: Analyzing trace with hash -131427729, now seen corresponding path program 1 times [2018-12-09 01:39:36,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:36,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:36,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:36,892 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 01:39:36,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:39:36,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:39:36,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:36,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:39:36,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:39:36,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:39:36,893 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 4 states. [2018-12-09 01:39:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:36,913 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-09 01:39:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:39:36,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-09 01:39:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:36,914 INFO L225 Difference]: With dead ends: 46 [2018-12-09 01:39:36,914 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 01:39:36,914 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 01:39:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 01:39:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 01:39:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 01:39:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-12-09 01:39:36,916 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 15 [2018-12-09 01:39:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:36,917 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-12-09 01:39:36,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:39:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-12-09 01:39:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:39:36,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:36,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:39:36,917 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:36,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:36,918 INFO L82 PathProgramCache]: Analyzing trace with hash -131427728, now seen corresponding path program 1 times [2018-12-09 01:39:36,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:36,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:36,998 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 01:39:36,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:39:36,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:39:36,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:36,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:39:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:39:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:39:37,000 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 6 states. [2018-12-09 01:39:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:37,057 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-12-09 01:39:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:39:37,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 01:39:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:37,060 INFO L225 Difference]: With dead ends: 54 [2018-12-09 01:39:37,060 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 01:39:37,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:39:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 01:39:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-12-09 01:39:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 01:39:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-12-09 01:39:37,065 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 15 [2018-12-09 01:39:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:37,065 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-12-09 01:39:37,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:39:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-12-09 01:39:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:39:37,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:37,066 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:39:37,067 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:37,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:37,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1646684260, now seen corresponding path program 1 times [2018-12-09 01:39:37,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:37,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:37,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:37,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:37,129 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 01:39:37,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:39:37,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:39:37,130 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-09 01:39:37,131 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [13], [15], [40], [45], [48], [54], [55], [58], [88], [89], [90], [92] [2018-12-09 01:39:37,150 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:39:37,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:39:37,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:39:37,239 INFO L272 AbstractInterpreter]: Visited 17 different actions 18 times. Merged at 1 different actions 1 times. Never widened. Performed 142 root evaluator evaluations with a maximum evaluation depth of 4. Performed 142 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-09 01:39:37,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:37,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:39:37,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:39:37,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/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 01:39:37,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:37,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:39:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:37,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:39:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:39:37,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:39:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:39:37,350 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:39:37,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2018-12-09 01:39:37,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:37,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:39:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:39:37,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:39:37,351 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-12-09 01:39:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:37,404 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-12-09 01:39:37,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:39:37,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 01:39:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:37,405 INFO L225 Difference]: With dead ends: 80 [2018-12-09 01:39:37,405 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 01:39:37,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:39:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 01:39:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2018-12-09 01:39:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 01:39:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-12-09 01:39:37,408 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 18 [2018-12-09 01:39:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:37,409 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-09 01:39:37,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:39:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-12-09 01:39:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:39:37,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:37,409 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:39:37,410 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:37,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1409916617, now seen corresponding path program 1 times [2018-12-09 01:39:37,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:37,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:37,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:37,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:39:37,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:39:37,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:39:37,464 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-09 01:39:37,464 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [13], [15], [40], [45], [48], [50], [54], [55], [58], [88], [89], [90], [92] [2018-12-09 01:39:37,465 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:39:37,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:39:37,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:39:37,582 INFO L272 AbstractInterpreter]: Visited 18 different actions 87 times. Merged at 10 different actions 51 times. Never widened. Performed 817 root evaluator evaluations with a maximum evaluation depth of 4. Performed 817 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-09 01:39:37,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:37,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:39:37,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:39:37,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/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 01:39:37,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:37,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:39:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:37,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:39:37,651 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 01:39:37,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:37,659 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 01:39:37,661 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 01:39:37,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:37,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:37,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:39:37,675 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 [2018-12-09 01:39:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:39:37,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:39:37,785 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 10 treesize of output 3 [2018-12-09 01:39:37,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:37,790 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 15 treesize of output 19 [2018-12-09 01:39:37,798 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 8 treesize of output 1 [2018-12-09 01:39:37,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:37,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:37,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:37,802 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-12-09 01:39:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:39:37,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:39:37,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-12-09 01:39:37,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:39:37,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:39:37,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:39:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:39:37,828 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 11 states. [2018-12-09 01:39:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:38,119 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-09 01:39:38,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:39:38,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 01:39:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:38,121 INFO L225 Difference]: With dead ends: 95 [2018-12-09 01:39:38,121 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 01:39:38,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-12-09 01:39:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 01:39:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 63. [2018-12-09 01:39:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 01:39:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-09 01:39:38,125 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 20 [2018-12-09 01:39:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:38,125 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-09 01:39:38,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:39:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-12-09 01:39:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:39:38,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:38,126 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, 1] [2018-12-09 01:39:38,126 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:38,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:38,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1691721193, now seen corresponding path program 1 times [2018-12-09 01:39:38,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:38,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:38,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:38,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:38,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:39:38,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:39:38,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:39:38,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:38,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:39:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:39:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:39:38,147 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2018-12-09 01:39:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:38,192 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-09 01:39:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:39:38,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-09 01:39:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:38,193 INFO L225 Difference]: With dead ends: 61 [2018-12-09 01:39:38,193 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 01:39:38,193 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 01:39:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 01:39:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-09 01:39:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 01:39:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-12-09 01:39:38,196 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2018-12-09 01:39:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:38,196 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-09 01:39:38,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:39:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-12-09 01:39:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:39:38,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:38,197 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, 1] [2018-12-09 01:39:38,197 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:38,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:38,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1691721192, now seen corresponding path program 1 times [2018-12-09 01:39:38,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:38,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:38,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:38,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:38,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:39:38,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:39:38,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:39:38,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:38,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:39:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:39:38,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:39:38,276 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-12-09 01:39:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:38,331 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-12-09 01:39:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:39:38,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 01:39:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:38,332 INFO L225 Difference]: With dead ends: 53 [2018-12-09 01:39:38,332 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 01:39:38,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:39:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 01:39:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-09 01:39:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 01:39:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-12-09 01:39:38,334 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 22 [2018-12-09 01:39:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:38,335 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-12-09 01:39:38,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:39:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-12-09 01:39:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 01:39:38,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:38,335 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:39:38,335 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:38,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:38,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1145777194, now seen corresponding path program 1 times [2018-12-09 01:39:38,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:38,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:38,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:38,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:38,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 01:39:38,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:39:38,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:39:38,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:38,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:39:38,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:39:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:39:38,386 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 5 states. [2018-12-09 01:39:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:38,438 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-09 01:39:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:39:38,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-09 01:39:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:38,439 INFO L225 Difference]: With dead ends: 55 [2018-12-09 01:39:38,439 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 01:39:38,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:39:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 01:39:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-09 01:39:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 01:39:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-12-09 01:39:38,444 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 25 [2018-12-09 01:39:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:38,444 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-12-09 01:39:38,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:39:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-12-09 01:39:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 01:39:38,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:38,445 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, 1, 1, 1, 1, 1] [2018-12-09 01:39:38,445 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:38,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1551759193, now seen corresponding path program 1 times [2018-12-09 01:39:38,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:38,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:38,565 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 01:39:38,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:39:38,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:39:38,566 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 01:39:38,566 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [15], [19], [25], [36], [40], [45], [48], [54], [55], [58], [60], [65], [67], [69], [70], [88], [89], [90], [92], [93] [2018-12-09 01:39:38,567 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:39:38,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:39:38,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:39:38,586 INFO L272 AbstractInterpreter]: Visited 26 different actions 28 times. Merged at 1 different actions 1 times. Never widened. Performed 165 root evaluator evaluations with a maximum evaluation depth of 4. Performed 165 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 01:39:38,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:38,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:39:38,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:39:38,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:39:38,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:38,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:39:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:39:38,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:39:38,624 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 01:39:38,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:38,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:38,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-09 01:39:38,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 10 [2018-12-09 01:39:38,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:39:38,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:38,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:38,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:38,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-12-09 01:39:38,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 9 treesize of output 7 [2018-12-09 01:39:38,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:39:38,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:38,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:38,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:38,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2018-12-09 01:39:41,141 WARN L180 SmtUtils]: Spent 783.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-09 01:39:41,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 01:39:41,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 01:39:41,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:39:41,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2018-12-09 01:39:41,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-12-09 01:39:41,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 01:39:41,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 01:39:41,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,185 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2018-12-09 01:39:41,193 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 01:39:41,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:39:41,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-09 01:39:41,273 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-09 01:39:41,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 11 [2018-12-09 01:39:41,281 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-09 01:39:41,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:39:41,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:39:41,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:22, output treesize:13 [2018-12-09 01:39:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:39:41,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:39:41,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 16 [2018-12-09 01:39:41,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:39:41,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:39:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:39:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=193, Unknown=3, NotChecked=0, Total=240 [2018-12-09 01:39:41,309 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2018-12-09 01:39:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:39:41,370 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-09 01:39:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:39:41,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 01:39:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:39:41,371 INFO L225 Difference]: With dead ends: 60 [2018-12-09 01:39:41,371 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 01:39:41,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=56, Invalid=247, Unknown=3, NotChecked=0, Total=306 [2018-12-09 01:39:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 01:39:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-12-09 01:39:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 01:39:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-12-09 01:39:41,374 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 26 [2018-12-09 01:39:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:39:41,374 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-12-09 01:39:41,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:39:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-12-09 01:39:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 01:39:41,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:39:41,375 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, 1, 1, 1, 1, 1] [2018-12-09 01:39:41,376 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:39:41,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:39:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1552067033, now seen corresponding path program 1 times [2018-12-09 01:39:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:39:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:41,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:39:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:39:41,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:39:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:39:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:39:41,404 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:39:41,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:39:41 BoogieIcfgContainer [2018-12-09 01:39:41,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:39:41,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:39:41,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:39:41,436 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:39:41,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:39:36" (3/4) ... [2018-12-09 01:39:41,438 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 01:39:41,475 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_71b6459f-2a4f-463a-b6d5-6a610797569f/bin-2019/utaipan/witness.graphml [2018-12-09 01:39:41,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:39:41,476 INFO L168 Benchmark]: Toolchain (without parser) took 5475.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -66.1 MB). Peak memory consumption was 128.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:39:41,477 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:39:41,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:39:41,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.93 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 01:39:41,478 INFO L168 Benchmark]: Boogie Preprocessor took 16.46 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 01:39:41,478 INFO L168 Benchmark]: RCFGBuilder took 183.14 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:39:41,478 INFO L168 Benchmark]: TraceAbstraction took 4937.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.0 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:39:41,478 INFO L168 Benchmark]: Witness Printer took 40.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:39:41,480 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.46 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 183.14 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4937.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.0 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. * Witness Printer took 40.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 643]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=11, \old(a)=8, \old(b)=5, \old(b)=12, \old(n)=10, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] a = malloc(n * sizeof(*a)) [L637] b = malloc(n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, b++={9:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={9:0}, n=1] [L638] *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, b++={9:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={9:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, i=0, n=1] [L626] a[i] = -1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, i=0, n=1] [L627] COND FALSE !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, i=0, n=1] [L639] RET foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={9:0}, n=1] [L640] b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, b[-1]=0, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={9:0}, n=1] [L640] COND FALSE !(b[-1]) [L643] free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={9:0}, n=1] [L643] free(a) [L643] free(b) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={9:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={9:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 17 error locations. UNSAFE Result, 4.9s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 414 SDtfs, 543 SDslu, 542 SDs, 0 SdLazy, 564 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 64 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 303 ConstructedInterpolants, 16 QuantifiedInterpolants, 40812 SizeOfPredicates, 24 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 22/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...