./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/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 a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:51:09,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:51:09,553 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:51:09,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:51:09,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:51:09,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:51:09,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:51:09,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:51:09,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:51:09,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:51:09,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:51:09,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:51:09,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:51:09,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:51:09,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:51:09,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:51:09,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:51:09,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:51:09,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:51:09,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:51:09,575 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:51:09,576 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:51:09,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:51:09,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:51:09,578 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:51:09,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:51:09,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:51:09,580 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:51:09,581 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:51:09,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:51:09,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:51:09,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:51:09,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:51:09,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:51:09,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:51:09,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:51:09,584 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-18 16:51:09,595 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:51:09,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:51:09,596 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:51:09,596 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:51:09,597 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:51:09,597 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:51:09,597 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:51:09,597 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:51:09,597 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:51:09,597 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:51:09,597 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:51:09,598 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:51:09,598 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:51:09,598 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:51:09,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:51:09,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:51:09,599 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:51:09,599 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:51:09,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:51:09,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:51:09,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:51:09,599 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 16:51:09,600 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 16:51:09,600 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 16:51:09,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:51:09,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:51:09,600 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:51:09,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:51:09,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:51:09,601 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:51:09,601 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:51:09,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:51:09,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:51:09,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:51:09,601 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:51:09,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:51:09,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:51:09,602 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_4102253b-01d6-406a-8cc2-3a6acf412a47/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 -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2018-11-18 16:51:09,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:51:09,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:51:09,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:51:09,637 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:51:09,638 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:51:09,638 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-11-18 16:51:09,676 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/data/b1d262113/d8a77e830e604507bf997b1deac36ccb/FLAG4d8ac119f [2018-11-18 16:51:10,072 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:51:10,073 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-11-18 16:51:10,076 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/data/b1d262113/d8a77e830e604507bf997b1deac36ccb/FLAG4d8ac119f [2018-11-18 16:51:10,085 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/data/b1d262113/d8a77e830e604507bf997b1deac36ccb [2018-11-18 16:51:10,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:51:10,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:51:10,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:51:10,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:51:10,090 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:51:10,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10, skipping insertion in model container [2018-11-18 16:51:10,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:51:10,110 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:51:10,218 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:51:10,223 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:51:10,234 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:51:10,243 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:51:10,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10 WrapperNode [2018-11-18 16:51:10,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:51:10,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:51:10,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:51:10,244 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:51:10,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:51:10,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:51:10,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:51:10,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:51:10,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... [2018-11-18 16:51:10,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:51:10,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:51:10,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:51:10,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:51:10,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/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-11-18 16:51:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:51:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:51:10,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:51:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:51:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-18 16:51:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-18 16:51:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:51:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:51:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:51:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:51:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:51:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:51:10,530 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:51:10,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:51:10 BoogieIcfgContainer [2018-11-18 16:51:10,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:51:10,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:51:10,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:51:10,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:51:10,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:51:10" (1/3) ... [2018-11-18 16:51:10,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f5aee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:51:10, skipping insertion in model container [2018-11-18 16:51:10,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:10" (2/3) ... [2018-11-18 16:51:10,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f5aee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:51:10, skipping insertion in model container [2018-11-18 16:51:10,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:51:10" (3/3) ... [2018-11-18 16:51:10,538 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-11-18 16:51:10,547 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:51:10,554 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-18 16:51:10,567 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-18 16:51:10,589 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:51:10,589 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 16:51:10,589 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:51:10,590 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:51:10,590 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:51:10,590 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:51:10,590 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:51:10,590 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:51:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-18 16:51:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 16:51:10,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:10,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:10,614 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:10,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1597032710, now seen corresponding path program 1 times [2018-11-18 16:51:10,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:10,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:10,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:10,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:10,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:51:10,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:10,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:51:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:51:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:51:10,734 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-18 16:51:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:10,746 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-18 16:51:10,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:51:10,747 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 16:51:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:10,753 INFO L225 Difference]: With dead ends: 43 [2018-11-18 16:51:10,753 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 16:51:10,755 INFO L604 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-11-18 16:51:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 16:51:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-18 16:51:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 16:51:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-18 16:51:10,779 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 11 [2018-11-18 16:51:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:10,780 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-18 16:51:10,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:51:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-18 16:51:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 16:51:10,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:10,780 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:10,781 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:10,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1820883224, now seen corresponding path program 1 times [2018-11-18 16:51:10,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:10,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:10,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:10,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:10,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:51:10,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:10,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:51:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:51:10,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:51:10,831 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2018-11-18 16:51:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:10,877 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-11-18 16:51:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:51:10,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-18 16:51:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:10,879 INFO L225 Difference]: With dead ends: 59 [2018-11-18 16:51:10,879 INFO L226 Difference]: Without dead ends: 59 [2018-11-18 16:51:10,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:51:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-18 16:51:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2018-11-18 16:51:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 16:51:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-18 16:51:10,886 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2018-11-18 16:51:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:10,886 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-18 16:51:10,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:51:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-18 16:51:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 16:51:10,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:10,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:10,887 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:10,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash 697121729, now seen corresponding path program 1 times [2018-11-18 16:51:10,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:10,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:10,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:10,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:10,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:51:10,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:10,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:51:10,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:51:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:51:10,955 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 5 states. [2018-11-18 16:51:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:11,046 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-11-18 16:51:11,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:51:11,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 16:51:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:11,048 INFO L225 Difference]: With dead ends: 65 [2018-11-18 16:51:11,048 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 16:51:11,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:51:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 16:51:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2018-11-18 16:51:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 16:51:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-11-18 16:51:11,053 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 13 [2018-11-18 16:51:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:11,054 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-11-18 16:51:11,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:51:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-11-18 16:51:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 16:51:11,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:11,054 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:11,055 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:11,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:11,055 INFO L82 PathProgramCache]: Analyzing trace with hash -497753495, now seen corresponding path program 1 times [2018-11-18 16:51:11,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:11,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:11,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:11,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:11,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:11,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:11,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:51:11,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:11,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:51:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:51:11,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:51:11,082 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 3 states. [2018-11-18 16:51:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:11,098 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-18 16:51:11,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:51:11,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 16:51:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:11,100 INFO L225 Difference]: With dead ends: 49 [2018-11-18 16:51:11,100 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 16:51:11,101 INFO L604 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-11-18 16:51:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 16:51:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-18 16:51:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 16:51:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-18 16:51:11,104 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 17 [2018-11-18 16:51:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:11,104 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-18 16:51:11,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:51:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-18 16:51:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 16:51:11,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:11,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:11,105 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:11,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash -497753494, now seen corresponding path program 1 times [2018-11-18 16:51:11,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:11,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:11,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:11,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:11,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:11,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:11,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:51:11,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:11,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:51:11,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:51:11,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:51:11,146 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-11-18 16:51:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:11,171 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-18 16:51:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:51:11,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 16:51:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:11,172 INFO L225 Difference]: With dead ends: 53 [2018-11-18 16:51:11,172 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 16:51:11,172 INFO L604 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-11-18 16:51:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 16:51:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-18 16:51:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 16:51:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-11-18 16:51:11,176 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 17 [2018-11-18 16:51:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:11,176 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-11-18 16:51:11,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:51:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-11-18 16:51:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:51:11,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:11,177 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:11,177 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:11,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash -334869196, now seen corresponding path program 1 times [2018-11-18 16:51:11,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:11,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:11,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:11,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:11,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:11,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:11,215 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-18 16:51:11,216 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [23], [24], [28], [32], [35], [37], [39], [40], [43], [45], [49], [53], [58], [61], [76], [77], [78], [80], [81] [2018-11-18 16:51:11,243 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:51:11,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:51:11,367 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:51:11,368 INFO L272 AbstractInterpreter]: Visited 20 different actions 30 times. Merged at 3 different actions 3 times. Never widened. Performed 159 root evaluator evaluations with a maximum evaluation depth of 4. Performed 159 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-11-18 16:51:11,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:11,373 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:51:11,433 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 55.65% of their original sizes. [2018-11-18 16:51:11,434 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:51:11,547 INFO L415 sIntCurrentIteration]: We unified 24 AI predicates to 24 [2018-11-18 16:51:11,547 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:51:11,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:51:11,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-18 16:51:11,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:11,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:51:11,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:51:11,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:51:11,549 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 12 states. [2018-11-18 16:51:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:12,197 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-11-18 16:51:12,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:51:12,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-18 16:51:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:12,199 INFO L225 Difference]: With dead ends: 89 [2018-11-18 16:51:12,199 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 16:51:12,199 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:51:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 16:51:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2018-11-18 16:51:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-18 16:51:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-11-18 16:51:12,205 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 25 [2018-11-18 16:51:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:12,206 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-11-18 16:51:12,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:51:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-18 16:51:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:51:12,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:12,207 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:12,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:12,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:12,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1706693882, now seen corresponding path program 1 times [2018-11-18 16:51:12,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 16:51:12,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:12,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:51:12,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:12,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:51:12,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:51:12,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:51:12,251 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 5 states. [2018-11-18 16:51:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:12,300 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-11-18 16:51:12,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:51:12,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-18 16:51:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:12,301 INFO L225 Difference]: With dead ends: 88 [2018-11-18 16:51:12,301 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 16:51:12,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:51:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 16:51:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2018-11-18 16:51:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 16:51:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-18 16:51:12,306 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 26 [2018-11-18 16:51:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:12,306 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-18 16:51:12,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:51:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-18 16:51:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 16:51:12,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:12,307 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:12,307 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:12,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:12,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1367902743, now seen corresponding path program 1 times [2018-11-18 16:51:12,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:12,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:12,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:12,431 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-18 16:51:12,431 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [16], [23], [24], [28], [32], [37], [39], [40], [43], [45], [76], [77], [78], [80], [81] [2018-11-18 16:51:12,434 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:51:12,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:51:12,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:51:12,462 INFO L272 AbstractInterpreter]: Visited 22 different actions 32 times. Merged at 3 different actions 3 times. Never widened. Performed 167 root evaluator evaluations with a maximum evaluation depth of 4. Performed 167 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-11-18 16:51:12,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:12,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:51:12,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:12,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/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-11-18 16:51:12,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:12,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:51:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:12,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:12,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:51:12,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:12,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:12,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:51:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 16:51:12,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 16:51:12,645 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:51:12,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 13 [2018-11-18 16:51:12,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:12,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:51:12,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:51:12,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:51:12,646 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 6 states. [2018-11-18 16:51:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:12,693 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-18 16:51:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:51:12,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-18 16:51:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:12,694 INFO L225 Difference]: With dead ends: 87 [2018-11-18 16:51:12,695 INFO L226 Difference]: Without dead ends: 87 [2018-11-18 16:51:12,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:51:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-18 16:51:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-11-18 16:51:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 16:51:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2018-11-18 16:51:12,700 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 27 [2018-11-18 16:51:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:12,700 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2018-11-18 16:51:12,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:51:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2018-11-18 16:51:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 16:51:12,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:12,701 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:12,701 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:12,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1367902744, now seen corresponding path program 1 times [2018-11-18 16:51:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:12,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:12,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:12,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:12,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:51:12,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:12,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:51:12,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:51:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:51:12,737 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 5 states. [2018-11-18 16:51:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:12,764 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-18 16:51:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:51:12,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 16:51:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:12,765 INFO L225 Difference]: With dead ends: 78 [2018-11-18 16:51:12,765 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 16:51:12,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:51:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 16:51:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-18 16:51:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 16:51:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-11-18 16:51:12,769 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 27 [2018-11-18 16:51:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:12,769 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-11-18 16:51:12,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:51:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-18 16:51:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:51:12,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:12,770 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:12,770 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:12,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash -588617937, now seen corresponding path program 1 times [2018-11-18 16:51:12,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:12,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:12,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 16:51:12,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:12,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:51:12,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:12,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:51:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:51:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:51:12,836 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 6 states. [2018-11-18 16:51:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:12,881 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-18 16:51:12,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:51:12,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-18 16:51:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:12,882 INFO L225 Difference]: With dead ends: 83 [2018-11-18 16:51:12,882 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 16:51:12,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:51:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 16:51:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-11-18 16:51:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 16:51:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-11-18 16:51:12,885 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 30 [2018-11-18 16:51:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:12,886 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-11-18 16:51:12,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:51:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-11-18 16:51:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 16:51:12,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:12,886 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:12,886 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:12,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -166630146, now seen corresponding path program 1 times [2018-11-18 16:51:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:12,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:12,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:12,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:12,935 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-18 16:51:12,935 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [14], [17], [19], [23], [24], [28], [32], [37], [39], [40], [43], [45], [76], [77], [78], [80], [81] [2018-11-18 16:51:12,936 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:51:12,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:51:13,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:51:13,054 INFO L272 AbstractInterpreter]: Visited 25 different actions 164 times. Merged at 17 different actions 99 times. Never widened. Performed 821 root evaluator evaluations with a maximum evaluation depth of 4. Performed 821 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 3 different actions. Largest state had 23 variables. [2018-11-18 16:51:13,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:13,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:51:13,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:13,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/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-11-18 16:51:13,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:13,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:51:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:13,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:13,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:13,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:51:13,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2018-11-18 16:51:13,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:51:13,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:51:13,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:51:13,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:51:13,210 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 11 states. [2018-11-18 16:51:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:13,295 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-11-18 16:51:13,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:51:13,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 16:51:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:13,296 INFO L225 Difference]: With dead ends: 119 [2018-11-18 16:51:13,296 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 16:51:13,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:51:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 16:51:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2018-11-18 16:51:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 16:51:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-18 16:51:13,302 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2018-11-18 16:51:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:13,302 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-18 16:51:13,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:51:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-18 16:51:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 16:51:13,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:13,303 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:13,303 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:13,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1434245735, now seen corresponding path program 2 times [2018-11-18 16:51:13,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:13,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:13,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:13,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:13,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:51:13,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:13,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:13,379 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:51:13,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:51:13,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:13,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/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-11-18 16:51:13,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:51:13,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:51:13,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 16:51:13,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:13,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:51:13,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:51:13,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:51:13,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 15 [2018-11-18 16:51:13,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:51:13,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:51:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:51:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:51:13,570 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 14 states. [2018-11-18 16:51:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:13,680 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-11-18 16:51:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:51:13,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-18 16:51:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:13,682 INFO L225 Difference]: With dead ends: 137 [2018-11-18 16:51:13,682 INFO L226 Difference]: Without dead ends: 137 [2018-11-18 16:51:13,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:51:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-18 16:51:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 100. [2018-11-18 16:51:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 16:51:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-11-18 16:51:13,687 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 45 [2018-11-18 16:51:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:13,687 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-11-18 16:51:13,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:51:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-11-18 16:51:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 16:51:13,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:13,688 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:13,688 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:13,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash -66745615, now seen corresponding path program 1 times [2018-11-18 16:51:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:13,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:13,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:51:13,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:13,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:13,724 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-18 16:51:13,724 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [32], [35], [37], [39], [40], [43], [45], [49], [53], [58], [61], [76], [77], [78], [80], [81] [2018-11-18 16:51:13,725 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:51:13,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:51:13,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:51:13,790 INFO L272 AbstractInterpreter]: Visited 29 different actions 128 times. Merged at 16 different actions 62 times. Never widened. Performed 605 root evaluator evaluations with a maximum evaluation depth of 4. Performed 605 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 3 different actions. Largest state had 23 variables. [2018-11-18 16:51:13,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:13,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:51:13,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:13,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:13,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:13,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:51:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:13,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:51:13,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:51:13,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:51:13,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-18 16:51:13,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:51:13,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:51:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:51:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:51:13,889 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2018-11-18 16:51:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:13,932 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-11-18 16:51:13,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:51:13,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-18 16:51:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:13,933 INFO L225 Difference]: With dead ends: 150 [2018-11-18 16:51:13,933 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 16:51:13,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:51:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 16:51:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 118. [2018-11-18 16:51:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-18 16:51:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-11-18 16:51:13,938 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 44 [2018-11-18 16:51:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:13,938 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-11-18 16:51:13,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:51:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-11-18 16:51:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 16:51:13,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:13,939 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:13,939 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:13,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1587916961, now seen corresponding path program 3 times [2018-11-18 16:51:13,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:13,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:13,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:13,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:13,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:51:13,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:13,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:13,999 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:51:13,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:51:13,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:13,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:14,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:51:14,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 16:51:14,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:51:14,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:14,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:51:14,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:51:14,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:51:14,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2018-11-18 16:51:14,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:51:14,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:51:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:51:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:51:14,205 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 14 states. [2018-11-18 16:51:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:14,429 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-11-18 16:51:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:51:14,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-11-18 16:51:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:14,431 INFO L225 Difference]: With dead ends: 135 [2018-11-18 16:51:14,431 INFO L226 Difference]: Without dead ends: 135 [2018-11-18 16:51:14,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:51:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-18 16:51:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2018-11-18 16:51:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 16:51:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-11-18 16:51:14,434 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 51 [2018-11-18 16:51:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:14,435 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-11-18 16:51:14,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:51:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-11-18 16:51:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 16:51:14,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:14,436 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:14,436 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:14,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1980785582, now seen corresponding path program 1 times [2018-11-18 16:51:14,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:14,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:14,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:14,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:14,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:51:14,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:14,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:14,550 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-18 16:51:14,551 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [16], [17], [19], [23], [24], [28], [32], [37], [39], [40], [43], [45], [76], [77], [78], [80], [81] [2018-11-18 16:51:14,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:51:14,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:51:14,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:51:14,621 INFO L272 AbstractInterpreter]: Visited 25 different actions 139 times. Merged at 17 different actions 77 times. Never widened. Performed 682 root evaluator evaluations with a maximum evaluation depth of 5. Performed 682 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 10 fixpoints after 2 different actions. Largest state had 23 variables. [2018-11-18 16:51:14,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:14,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:51:14,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:14,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:14,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:14,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:51:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:14,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:14,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:51:14,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:14,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:14,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:51:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:51:14,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:51:14,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:51:14,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 15 [2018-11-18 16:51:14,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:51:14,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:51:14,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:51:14,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-18 16:51:14,819 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 12 states. [2018-11-18 16:51:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:14,953 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-11-18 16:51:14,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:51:14,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-18 16:51:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:14,954 INFO L225 Difference]: With dead ends: 133 [2018-11-18 16:51:14,954 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 16:51:14,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-11-18 16:51:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 16:51:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2018-11-18 16:51:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-18 16:51:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-11-18 16:51:14,958 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 52 [2018-11-18 16:51:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:14,959 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-11-18 16:51:14,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:51:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-11-18 16:51:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 16:51:14,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:14,960 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:14,960 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:14,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash 620245772, now seen corresponding path program 2 times [2018-11-18 16:51:14,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:14,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:14,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 16:51:15,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:15,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:15,004 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:51:15,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:51:15,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:15,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:15,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:51:15,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:51:15,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-18 16:51:15,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:15,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:15,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:51:15,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:15,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:15,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:51:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 16:51:15,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 16:51:15,225 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:51:15,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 13 [2018-11-18 16:51:15,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:15,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:51:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:51:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:51:15,226 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 6 states. [2018-11-18 16:51:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:15,245 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-11-18 16:51:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:51:15,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-18 16:51:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:15,246 INFO L225 Difference]: With dead ends: 113 [2018-11-18 16:51:15,246 INFO L226 Difference]: Without dead ends: 113 [2018-11-18 16:51:15,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:51:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-18 16:51:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-18 16:51:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-18 16:51:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2018-11-18 16:51:15,250 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 57 [2018-11-18 16:51:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:15,250 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2018-11-18 16:51:15,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:51:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2018-11-18 16:51:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 16:51:15,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:15,251 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:15,252 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:15,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 792490303, now seen corresponding path program 1 times [2018-11-18 16:51:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:15,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:15,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 16:51:15,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:15,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:15,310 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 16:51:15,311 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [32], [35], [37], [39], [40], [43], [45], [49], [53], [58], [59], [64], [66], [75], [76], [77], [78], [80], [81] [2018-11-18 16:51:15,312 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:51:15,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:51:15,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:51:15,380 INFO L272 AbstractInterpreter]: Visited 32 different actions 131 times. Merged at 16 different actions 62 times. Never widened. Performed 618 root evaluator evaluations with a maximum evaluation depth of 4. Performed 618 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 3 different actions. Largest state had 23 variables. [2018-11-18 16:51:15,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:15,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:51:15,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:15,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:15,405 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:51:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:15,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:51:15,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 16:51:15,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:15,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2018-11-18 16:51:15,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:15,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:51:15,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:51:15,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:51:15,551 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand 6 states. [2018-11-18 16:51:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:15,593 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-11-18 16:51:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:51:15,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-18 16:51:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:15,594 INFO L225 Difference]: With dead ends: 94 [2018-11-18 16:51:15,594 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 16:51:15,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:51:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 16:51:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-11-18 16:51:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 16:51:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-18 16:51:15,596 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 60 [2018-11-18 16:51:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:15,596 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-18 16:51:15,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:51:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-18 16:51:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 16:51:15,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:15,597 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:15,597 INFO L423 AbstractCegarLoop]: === Iteration 18 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-18 16:51:15,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1293847241, now seen corresponding path program 2 times [2018-11-18 16:51:15,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:51:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:15,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:15,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:51:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 16:51:15,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:15,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:51:15,635 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:51:15,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:51:15,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:15,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:15,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:51:15,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:51:15,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-18 16:51:15,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:15,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:15,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:15,693 INFO L477 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 12 treesize of output 5 [2018-11-18 16:51:15,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:15,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:15,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-18 16:51:15,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:15,729 INFO L477 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 12 treesize of output 5 [2018-11-18 16:51:15,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:15,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:15,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-18 16:51:15,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:15,757 INFO L477 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 12 treesize of output 5 [2018-11-18 16:51:15,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:15,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:15,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-18 16:51:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 16:51:16,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 16:51:16,098 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:51:16,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 12 [2018-11-18 16:51:16,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:51:16,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:51:16,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:51:16,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-11-18 16:51:16,099 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 6 states. [2018-11-18 16:51:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:20,706 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-18 16:51:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:51:20,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 16:51:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:20,706 INFO L225 Difference]: With dead ends: 80 [2018-11-18 16:51:20,706 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:51:20,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2018-11-18 16:51:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:51:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:51:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:51:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:51:20,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-11-18 16:51:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:20,707 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:51:20,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:51:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:51:20,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:51:20,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:51:20 BoogieIcfgContainer [2018-11-18 16:51:20,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:51:20,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:51:20,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:51:20,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:51:20,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:51:10" (3/4) ... [2018-11-18 16:51:20,713 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:51:20,716 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:51:20,716 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-18 16:51:20,716 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:51:20,719 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-18 16:51:20,719 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-18 16:51:20,719 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 16:51:20,719 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:51:20,750 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4102253b-01d6-406a-8cc2-3a6acf412a47/bin-2019/utaipan/witness.graphml [2018-11-18 16:51:20,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:51:20,751 INFO L168 Benchmark]: Toolchain (without parser) took 10664.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 959.2 MB in the beginning and 924.2 MB in the end (delta: 35.0 MB). Peak memory consumption was 211.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:20,753 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:51:20,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:20,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.31 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:20,753 INFO L168 Benchmark]: Boogie Preprocessor took 52.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:20,754 INFO L168 Benchmark]: RCFGBuilder took 218.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:20,754 INFO L168 Benchmark]: TraceAbstraction took 10179.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 929.4 MB in the end (delta: 177.9 MB). Peak memory consumption was 227.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:20,754 INFO L168 Benchmark]: Witness Printer took 39.99 ms. Allocated memory is still 1.2 GB. Free memory was 929.4 MB in the beginning and 924.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:20,756 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.31 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 218.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10179.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.1 GB in the beginning and 929.4 MB in the end (delta: 177.9 MB). Peak memory consumption was 227.2 MB. Max. memory is 11.5 GB. * Witness Printer took 39.99 ms. Allocated memory is still 1.2 GB. Free memory was 929.4 MB in the beginning and 924.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 8 error locations. SAFE Result, 10.1s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 539 SDtfs, 848 SDslu, 1142 SDs, 0 SdLazy, 1197 SolverSat, 129 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1007 GetRequests, 817 SyntacticMatches, 36 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.8963484432234433 AbsIntWeakeningRatio, 0.8333333333333334 AbsIntAvgWeakeningVarsNumRemoved, 2.5416666666666665 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 203 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 931 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1444 ConstructedInterpolants, 104 QuantifiedInterpolants, 293054 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 36 InterpolantComputations, 15 PerfectInterpolantSequences, 812/1006 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...